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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:13:19,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:13:19,441 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:13:19,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:13:19,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:13:19,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:13:19,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:13:19,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:13:19,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:13:19,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:13:19,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:13:19,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:13:19,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:13:19,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:13:19,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:13:19,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:13:19,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:13:19,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:13:19,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:13:19,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:13:19,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:13:19,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:13:19,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:13:19,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:13:19,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:13:19,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:13:19,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:13:19,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:13:19,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:13:19,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:13:19,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:13:19,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:13:19,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:13:19,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:13:19,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:13:19,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:13:19,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:13:19,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:13:19,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:13:19,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:13:19,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:13:19,551 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:13:19,582 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:13:19,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:13:19,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:13:19,584 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:13:19,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:13:19,585 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:13:19,585 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:13:19,585 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:13:19,585 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:13:19,586 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:13:19,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:13:19,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:13:19,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:13:19,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:13:19,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:13:19,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:13:19,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:13:19,591 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:13:19,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:13:19,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:13:19,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:13:19,592 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:13:19,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:13:19,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:13:19,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:13:19,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:13:19,593 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:13:19,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:13:19,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:13:19,594 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:13:19,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:13:19,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:13:19,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:13:19,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:13:19,670 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:13:19,671 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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:13:19,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3f061b6/d356d6147dfa4840bbc42eef27621cde/FLAG448514247 [2019-09-10 07:13:20,467 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:13:20,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:13:20,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3f061b6/d356d6147dfa4840bbc42eef27621cde/FLAG448514247 [2019-09-10 07:13:21,001 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3f061b6/d356d6147dfa4840bbc42eef27621cde [2019-09-10 07:13:21,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:13:21,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:13:21,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:13:21,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:13:21,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:13:21,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:13:21" (1/1) ... [2019-09-10 07:13:21,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308db9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:21, skipping insertion in model container [2019-09-10 07:13:21,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:13:21" (1/1) ... [2019-09-10 07:13:21,029 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:13:21,239 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:13:22,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:13:22,595 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:13:23,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:13:23,369 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:13:23,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:23 WrapperNode [2019-09-10 07:13:23,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:13:23,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:13:23,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:13:23,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:13:23,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:23" (1/1) ... [2019-09-10 07:13:23,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:23" (1/1) ... [2019-09-10 07:13:23,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:23" (1/1) ... [2019-09-10 07:13:23,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:23" (1/1) ... [2019-09-10 07:13:23,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:23" (1/1) ... [2019-09-10 07:13:23,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:23" (1/1) ... [2019-09-10 07:13:23,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:23" (1/1) ... [2019-09-10 07:13:23,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:13:23,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:13:23,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:13:23,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:13:23,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:23" (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:13:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:13:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:13:23,734 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:13:23,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:13:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:13:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:13:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:13:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:13:23,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:13:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:13:23,736 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:13:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:13:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:13:23,741 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:13:23,741 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:13:23,742 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:13:23,742 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:13:23,742 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:13:23,743 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:13:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:13:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:13:28,886 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:13:28,887 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:13:28,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:13:28 BoogieIcfgContainer [2019-09-10 07:13:28,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:13:28,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:13:28,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:13:28,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:13:28,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:13:21" (1/3) ... [2019-09-10 07:13:28,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8393d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:13:28, skipping insertion in model container [2019-09-10 07:13:28,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:13:23" (2/3) ... [2019-09-10 07:13:28,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8393d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:13:28, skipping insertion in model container [2019-09-10 07:13:28,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:13:28" (3/3) ... [2019-09-10 07:13:28,898 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 07:13:28,909 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:13:28,940 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-09-10 07:13:28,962 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-09-10 07:13:28,999 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:13:28,999 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:13:28,999 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:13:28,999 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:13:29,000 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:13:29,000 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:13:29,000 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:13:29,000 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:13:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states. [2019-09-10 07:13:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:13:29,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:29,110 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] [2019-09-10 07:13:29,113 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:29,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:29,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1130325089, now seen corresponding path program 1 times [2019-09-10 07:13:29,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:29,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:29,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:29,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:29,905 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:29,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:29,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:29,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:29,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:29,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:29,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:29,934 INFO L87 Difference]: Start difference. First operand 1756 states. Second operand 3 states. [2019-09-10 07:13:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:30,125 INFO L93 Difference]: Finished difference Result 1987 states and 3513 transitions. [2019-09-10 07:13:30,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:30,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:13:30,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:30,170 INFO L225 Difference]: With dead ends: 1987 [2019-09-10 07:13:30,170 INFO L226 Difference]: Without dead ends: 1979 [2019-09-10 07:13:30,174 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:13:30,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-09-10 07:13:30,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1969. [2019-09-10 07:13:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-09-10 07:13:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2655 transitions. [2019-09-10 07:13:30,331 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2655 transitions. Word has length 79 [2019-09-10 07:13:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:30,333 INFO L475 AbstractCegarLoop]: Abstraction has 1969 states and 2655 transitions. [2019-09-10 07:13:30,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2655 transitions. [2019-09-10 07:13:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:13:30,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:30,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:30,345 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash 525516661, now seen corresponding path program 1 times [2019-09-10 07:13:30,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:30,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:30,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:30,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:30,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:30,807 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:30,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:30,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:13:30,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:30,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:13:30,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:13:30,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:13:30,811 INFO L87 Difference]: Start difference. First operand 1969 states and 2655 transitions. Second operand 6 states. [2019-09-10 07:13:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:32,408 INFO L93 Difference]: Finished difference Result 2254 states and 3182 transitions. [2019-09-10 07:13:32,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:32,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-09-10 07:13:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:32,423 INFO L225 Difference]: With dead ends: 2254 [2019-09-10 07:13:32,423 INFO L226 Difference]: Without dead ends: 2254 [2019-09-10 07:13:32,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:13:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2019-09-10 07:13:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2234. [2019-09-10 07:13:32,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2019-09-10 07:13:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3172 transitions. [2019-09-10 07:13:32,488 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3172 transitions. Word has length 79 [2019-09-10 07:13:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:32,489 INFO L475 AbstractCegarLoop]: Abstraction has 2234 states and 3172 transitions. [2019-09-10 07:13:32,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:13:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3172 transitions. [2019-09-10 07:13:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:13:32,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:32,495 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] [2019-09-10 07:13:32,495 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:32,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:32,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1297825525, now seen corresponding path program 1 times [2019-09-10 07:13:32,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:32,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:32,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:32,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:32,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:32,700 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,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:32,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:13:32,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:32,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:13:32,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:13:32,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:32,706 INFO L87 Difference]: Start difference. First operand 2234 states and 3172 transitions. Second operand 5 states. [2019-09-10 07:13:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:34,260 INFO L93 Difference]: Finished difference Result 2837 states and 4141 transitions. [2019-09-10 07:13:34,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:34,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-10 07:13:34,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:34,274 INFO L225 Difference]: With dead ends: 2837 [2019-09-10 07:13:34,274 INFO L226 Difference]: Without dead ends: 2837 [2019-09-10 07:13:34,275 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:13:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2019-09-10 07:13:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2827. [2019-09-10 07:13:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2827 states. [2019-09-10 07:13:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4136 transitions. [2019-09-10 07:13:34,337 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4136 transitions. Word has length 80 [2019-09-10 07:13:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:34,338 INFO L475 AbstractCegarLoop]: Abstraction has 2827 states and 4136 transitions. [2019-09-10 07:13:34,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:13:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4136 transitions. [2019-09-10 07:13:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:13:34,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:34,343 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] [2019-09-10 07:13:34,344 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:34,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1374038338, now seen corresponding path program 1 times [2019-09-10 07:13:34,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:34,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:34,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:34,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:34,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:34,474 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:34,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:34,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:34,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:34,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:34,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:34,476 INFO L87 Difference]: Start difference. First operand 2827 states and 4136 transitions. Second operand 3 states. [2019-09-10 07:13:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:34,567 INFO L93 Difference]: Finished difference Result 3989 states and 5783 transitions. [2019-09-10 07:13:34,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:34,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:13:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:34,588 INFO L225 Difference]: With dead ends: 3989 [2019-09-10 07:13:34,588 INFO L226 Difference]: Without dead ends: 3989 [2019-09-10 07:13:34,589 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:13:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2019-09-10 07:13:34,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3973. [2019-09-10 07:13:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2019-09-10 07:13:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 5772 transitions. [2019-09-10 07:13:34,719 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 5772 transitions. Word has length 81 [2019-09-10 07:13:34,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:34,720 INFO L475 AbstractCegarLoop]: Abstraction has 3973 states and 5772 transitions. [2019-09-10 07:13:34,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 5772 transitions. [2019-09-10 07:13:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:13:34,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:34,729 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] [2019-09-10 07:13:34,729 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash 172328457, now seen corresponding path program 1 times [2019-09-10 07:13:34,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:34,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:34,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:34,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:34,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:34,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:34,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:34,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:34,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:34,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:34,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:34,906 INFO L87 Difference]: Start difference. First operand 3973 states and 5772 transitions. Second operand 3 states. [2019-09-10 07:13:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:35,085 INFO L93 Difference]: Finished difference Result 6234 states and 9067 transitions. [2019-09-10 07:13:35,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:35,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:13:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:35,127 INFO L225 Difference]: With dead ends: 6234 [2019-09-10 07:13:35,128 INFO L226 Difference]: Without dead ends: 6234 [2019-09-10 07:13:35,128 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:13:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2019-09-10 07:13:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 6224. [2019-09-10 07:13:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2019-09-10 07:13:35,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 9062 transitions. [2019-09-10 07:13:35,313 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 9062 transitions. Word has length 81 [2019-09-10 07:13:35,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:35,314 INFO L475 AbstractCegarLoop]: Abstraction has 6224 states and 9062 transitions. [2019-09-10 07:13:35,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 9062 transitions. [2019-09-10 07:13:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:13:35,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:35,328 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] [2019-09-10 07:13:35,328 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:35,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:35,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1024463430, now seen corresponding path program 1 times [2019-09-10 07:13:35,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:35,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:35,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:35,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:35,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:35,484 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:35,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:35,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:35,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:35,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:35,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:35,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:35,487 INFO L87 Difference]: Start difference. First operand 6224 states and 9062 transitions. Second operand 3 states. [2019-09-10 07:13:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:35,775 INFO L93 Difference]: Finished difference Result 10689 states and 15323 transitions. [2019-09-10 07:13:35,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:35,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:13:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:35,843 INFO L225 Difference]: With dead ends: 10689 [2019-09-10 07:13:35,844 INFO L226 Difference]: Without dead ends: 10689 [2019-09-10 07:13:35,844 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:13:35,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10689 states. [2019-09-10 07:13:36,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10689 to 10679. [2019-09-10 07:13:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10679 states. [2019-09-10 07:13:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10679 states to 10679 states and 15318 transitions. [2019-09-10 07:13:36,092 INFO L78 Accepts]: Start accepts. Automaton has 10679 states and 15318 transitions. Word has length 81 [2019-09-10 07:13:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:36,093 INFO L475 AbstractCegarLoop]: Abstraction has 10679 states and 15318 transitions. [2019-09-10 07:13:36,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 10679 states and 15318 transitions. [2019-09-10 07:13:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:13:36,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:36,110 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] [2019-09-10 07:13:36,119 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:36,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:36,120 INFO L82 PathProgramCache]: Analyzing trace with hash 214825384, now seen corresponding path program 1 times [2019-09-10 07:13:36,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:36,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:36,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:36,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:36,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:36,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:36,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:36,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:36,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:36,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:36,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:36,264 INFO L87 Difference]: Start difference. First operand 10679 states and 15318 transitions. Second operand 3 states. [2019-09-10 07:13:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:36,375 INFO L93 Difference]: Finished difference Result 15388 states and 21950 transitions. [2019-09-10 07:13:36,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:36,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:13:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:36,413 INFO L225 Difference]: With dead ends: 15388 [2019-09-10 07:13:36,413 INFO L226 Difference]: Without dead ends: 15388 [2019-09-10 07:13:36,414 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:13:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15388 states. [2019-09-10 07:13:36,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15388 to 15330. [2019-09-10 07:13:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15330 states. [2019-09-10 07:13:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15330 states to 15330 states and 21897 transitions. [2019-09-10 07:13:36,792 INFO L78 Accepts]: Start accepts. Automaton has 15330 states and 21897 transitions. Word has length 81 [2019-09-10 07:13:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:36,792 INFO L475 AbstractCegarLoop]: Abstraction has 15330 states and 21897 transitions. [2019-09-10 07:13:36,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:13:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 15330 states and 21897 transitions. [2019-09-10 07:13:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:13:36,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:36,812 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] [2019-09-10 07:13:36,813 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:36,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:36,814 INFO L82 PathProgramCache]: Analyzing trace with hash 944670416, now seen corresponding path program 1 times [2019-09-10 07:13:36,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:36,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:36,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:36,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:36,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:37,034 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:37,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:37,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:13:37,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:37,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:13:37,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:13:37,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:37,037 INFO L87 Difference]: Start difference. First operand 15330 states and 21897 transitions. Second operand 5 states. [2019-09-10 07:13:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:38,254 INFO L93 Difference]: Finished difference Result 20153 states and 28773 transitions. [2019-09-10 07:13:38,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:38,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 07:13:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:38,298 INFO L225 Difference]: With dead ends: 20153 [2019-09-10 07:13:38,298 INFO L226 Difference]: Without dead ends: 20153 [2019-09-10 07:13:38,299 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:13:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20153 states. [2019-09-10 07:13:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20153 to 20083. [2019-09-10 07:13:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20083 states. [2019-09-10 07:13:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20083 states to 20083 states and 28708 transitions. [2019-09-10 07:13:38,629 INFO L78 Accepts]: Start accepts. Automaton has 20083 states and 28708 transitions. Word has length 81 [2019-09-10 07:13:38,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:38,629 INFO L475 AbstractCegarLoop]: Abstraction has 20083 states and 28708 transitions. [2019-09-10 07:13:38,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:13:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 20083 states and 28708 transitions. [2019-09-10 07:13:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:13:38,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:38,649 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] [2019-09-10 07:13:38,650 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:38,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1273711453, now seen corresponding path program 1 times [2019-09-10 07:13:38,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:38,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:38,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:38,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:38,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:38,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:38,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:38,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:38,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:38,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:38,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:38,817 INFO L87 Difference]: Start difference. First operand 20083 states and 28708 transitions. Second operand 7 states. [2019-09-10 07:13:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:40,770 INFO L93 Difference]: Finished difference Result 70544 states and 102572 transitions. [2019-09-10 07:13:40,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:13:40,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-10 07:13:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:40,971 INFO L225 Difference]: With dead ends: 70544 [2019-09-10 07:13:40,971 INFO L226 Difference]: Without dead ends: 70544 [2019-09-10 07:13:40,972 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:13:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70544 states. [2019-09-10 07:13:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70544 to 20131. [2019-09-10 07:13:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20131 states. [2019-09-10 07:13:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20131 states to 20131 states and 28772 transitions. [2019-09-10 07:13:41,779 INFO L78 Accepts]: Start accepts. Automaton has 20131 states and 28772 transitions. Word has length 82 [2019-09-10 07:13:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:41,779 INFO L475 AbstractCegarLoop]: Abstraction has 20131 states and 28772 transitions. [2019-09-10 07:13:41,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 20131 states and 28772 transitions. [2019-09-10 07:13:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:13:41,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:41,796 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] [2019-09-10 07:13:41,796 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:41,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:41,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1971603743, now seen corresponding path program 1 times [2019-09-10 07:13:41,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:41,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:41,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:41,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:41,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:42,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:42,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:42,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:42,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:42,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:42,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:42,015 INFO L87 Difference]: Start difference. First operand 20131 states and 28772 transitions. Second operand 7 states. [2019-09-10 07:13:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:44,286 INFO L93 Difference]: Finished difference Result 75471 states and 109665 transitions. [2019-09-10 07:13:44,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:13:44,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-10 07:13:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:44,477 INFO L225 Difference]: With dead ends: 75471 [2019-09-10 07:13:44,479 INFO L226 Difference]: Without dead ends: 75471 [2019-09-10 07:13:44,480 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:13:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75471 states. [2019-09-10 07:13:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75471 to 20311. [2019-09-10 07:13:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20311 states. [2019-09-10 07:13:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20311 states to 20311 states and 29012 transitions. [2019-09-10 07:13:45,419 INFO L78 Accepts]: Start accepts. Automaton has 20311 states and 29012 transitions. Word has length 82 [2019-09-10 07:13:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:45,420 INFO L475 AbstractCegarLoop]: Abstraction has 20311 states and 29012 transitions. [2019-09-10 07:13:45,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20311 states and 29012 transitions. [2019-09-10 07:13:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:13:45,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:45,437 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] [2019-09-10 07:13:45,438 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:45,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1732967850, now seen corresponding path program 1 times [2019-09-10 07:13:45,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:45,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:45,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:45,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:45,629 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:45,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:45,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:45,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:45,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:45,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:45,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:45,631 INFO L87 Difference]: Start difference. First operand 20311 states and 29012 transitions. Second operand 7 states. [2019-09-10 07:13:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:47,737 INFO L93 Difference]: Finished difference Result 74157 states and 107808 transitions. [2019-09-10 07:13:47,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:13:47,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-10 07:13:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:47,862 INFO L225 Difference]: With dead ends: 74157 [2019-09-10 07:13:47,862 INFO L226 Difference]: Without dead ends: 74157 [2019-09-10 07:13:47,863 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:13:47,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74157 states. [2019-09-10 07:13:48,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74157 to 20679. [2019-09-10 07:13:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20679 states. [2019-09-10 07:13:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20679 states to 20679 states and 29504 transitions. [2019-09-10 07:13:48,592 INFO L78 Accepts]: Start accepts. Automaton has 20679 states and 29504 transitions. Word has length 82 [2019-09-10 07:13:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:48,593 INFO L475 AbstractCegarLoop]: Abstraction has 20679 states and 29504 transitions. [2019-09-10 07:13:48,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 20679 states and 29504 transitions. [2019-09-10 07:13:48,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:13:48,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:48,609 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] [2019-09-10 07:13:48,610 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:48,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:48,610 INFO L82 PathProgramCache]: Analyzing trace with hash 3049635, now seen corresponding path program 1 times [2019-09-10 07:13:48,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:48,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:48,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:48,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:48,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:48,787 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:48,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:48,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:13:48,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:48,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:13:48,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:13:48,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:13:48,791 INFO L87 Difference]: Start difference. First operand 20679 states and 29504 transitions. Second operand 4 states. [2019-09-10 07:13:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:48,932 INFO L93 Difference]: Finished difference Result 32613 states and 47180 transitions. [2019-09-10 07:13:48,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:13:48,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-10 07:13:48,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:48,995 INFO L225 Difference]: With dead ends: 32613 [2019-09-10 07:13:48,995 INFO L226 Difference]: Without dead ends: 32613 [2019-09-10 07:13:48,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:13:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32613 states. [2019-09-10 07:13:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32613 to 20677. [2019-09-10 07:13:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20677 states. [2019-09-10 07:13:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20677 states to 20677 states and 29455 transitions. [2019-09-10 07:13:49,580 INFO L78 Accepts]: Start accepts. Automaton has 20677 states and 29455 transitions. Word has length 83 [2019-09-10 07:13:49,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:49,580 INFO L475 AbstractCegarLoop]: Abstraction has 20677 states and 29455 transitions. [2019-09-10 07:13:49,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:13:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 20677 states and 29455 transitions. [2019-09-10 07:13:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:13:49,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:49,601 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] [2019-09-10 07:13:49,602 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:49,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1627572410, now seen corresponding path program 1 times [2019-09-10 07:13:49,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:49,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:49,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:49,769 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:49,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:49,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:13:49,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:49,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:13:49,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:13:49,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:13:49,772 INFO L87 Difference]: Start difference. First operand 20677 states and 29455 transitions. Second operand 4 states. [2019-09-10 07:13:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:49,898 INFO L93 Difference]: Finished difference Result 32611 states and 47131 transitions. [2019-09-10 07:13:49,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:13:49,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-10 07:13:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:49,950 INFO L225 Difference]: With dead ends: 32611 [2019-09-10 07:13:49,950 INFO L226 Difference]: Without dead ends: 32611 [2019-09-10 07:13:49,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:13:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32611 states. [2019-09-10 07:13:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32611 to 20675. [2019-09-10 07:13:50,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20675 states. [2019-09-10 07:13:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20675 states to 20675 states and 29406 transitions. [2019-09-10 07:13:50,352 INFO L78 Accepts]: Start accepts. Automaton has 20675 states and 29406 transitions. Word has length 83 [2019-09-10 07:13:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:50,352 INFO L475 AbstractCegarLoop]: Abstraction has 20675 states and 29406 transitions. [2019-09-10 07:13:50,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:13:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 20675 states and 29406 transitions. [2019-09-10 07:13:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:13:50,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:50,366 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] [2019-09-10 07:13:50,367 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:50,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:50,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1762698258, now seen corresponding path program 1 times [2019-09-10 07:13:50,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:50,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:50,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:50,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:50,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:50,516 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:50,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:50,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:13:50,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:50,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:13:50,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:13:50,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:50,518 INFO L87 Difference]: Start difference. First operand 20675 states and 29406 transitions. Second operand 5 states. [2019-09-10 07:13:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:51,500 INFO L93 Difference]: Finished difference Result 27389 states and 38643 transitions. [2019-09-10 07:13:51,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:51,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-10 07:13:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:51,534 INFO L225 Difference]: With dead ends: 27389 [2019-09-10 07:13:51,534 INFO L226 Difference]: Without dead ends: 27389 [2019-09-10 07:13:51,535 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:13:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27389 states. [2019-09-10 07:13:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27389 to 27293. [2019-09-10 07:13:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27293 states. [2019-09-10 07:13:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27293 states to 27293 states and 38550 transitions. [2019-09-10 07:13:52,049 INFO L78 Accepts]: Start accepts. Automaton has 27293 states and 38550 transitions. Word has length 83 [2019-09-10 07:13:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:52,050 INFO L475 AbstractCegarLoop]: Abstraction has 27293 states and 38550 transitions. [2019-09-10 07:13:52,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:13:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 27293 states and 38550 transitions. [2019-09-10 07:13:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:13:52,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:52,065 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] [2019-09-10 07:13:52,065 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:52,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:52,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1511631301, now seen corresponding path program 1 times [2019-09-10 07:13:52,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:52,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:52,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:52,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:52,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:52,201 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:52,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:52,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:13:52,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:52,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:13:52,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:13:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:13:52,203 INFO L87 Difference]: Start difference. First operand 27293 states and 38550 transitions. Second operand 5 states. [2019-09-10 07:13:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:53,125 INFO L93 Difference]: Finished difference Result 37574 states and 52999 transitions. [2019-09-10 07:13:53,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:13:53,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-10 07:13:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:53,169 INFO L225 Difference]: With dead ends: 37574 [2019-09-10 07:13:53,170 INFO L226 Difference]: Without dead ends: 37574 [2019-09-10 07:13:53,172 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:13:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37574 states. [2019-09-10 07:13:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37574 to 27293. [2019-09-10 07:13:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27293 states. [2019-09-10 07:13:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27293 states to 27293 states and 38414 transitions. [2019-09-10 07:13:53,612 INFO L78 Accepts]: Start accepts. Automaton has 27293 states and 38414 transitions. Word has length 83 [2019-09-10 07:13:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:53,613 INFO L475 AbstractCegarLoop]: Abstraction has 27293 states and 38414 transitions. [2019-09-10 07:13:53,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:13:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 27293 states and 38414 transitions. [2019-09-10 07:13:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:13:53,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:53,621 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] [2019-09-10 07:13:53,621 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:53,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:53,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1805655940, now seen corresponding path program 1 times [2019-09-10 07:13:53,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:53,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:53,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:53,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:53,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:53,761 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:53,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:53,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:53,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:53,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:53,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:53,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:53,764 INFO L87 Difference]: Start difference. First operand 27293 states and 38414 transitions. Second operand 7 states. [2019-09-10 07:13:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:55,789 INFO L93 Difference]: Finished difference Result 93815 states and 133790 transitions. [2019-09-10 07:13:55,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:13:55,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-09-10 07:13:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:55,895 INFO L225 Difference]: With dead ends: 93815 [2019-09-10 07:13:55,895 INFO L226 Difference]: Without dead ends: 93815 [2019-09-10 07:13:55,895 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:13:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93815 states. [2019-09-10 07:13:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93815 to 27922. [2019-09-10 07:13:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27922 states. [2019-09-10 07:13:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27922 states to 27922 states and 39262 transitions. [2019-09-10 07:13:56,682 INFO L78 Accepts]: Start accepts. Automaton has 27922 states and 39262 transitions. Word has length 84 [2019-09-10 07:13:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:56,682 INFO L475 AbstractCegarLoop]: Abstraction has 27922 states and 39262 transitions. [2019-09-10 07:13:56,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:13:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 27922 states and 39262 transitions. [2019-09-10 07:13:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:13:56,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:56,690 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] [2019-09-10 07:13:56,691 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:56,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1088887081, now seen corresponding path program 1 times [2019-09-10 07:13:56,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:56,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:56,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:56,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:56,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:56,824 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:56,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:56,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:13:56,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:56,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:13:56,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:13:56,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:13:56,826 INFO L87 Difference]: Start difference. First operand 27922 states and 39262 transitions. Second operand 7 states. [2019-09-10 07:13:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:58,543 INFO L93 Difference]: Finished difference Result 86256 states and 122683 transitions. [2019-09-10 07:13:58,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:13:58,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-09-10 07:13:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:58,641 INFO L225 Difference]: With dead ends: 86256 [2019-09-10 07:13:58,641 INFO L226 Difference]: Without dead ends: 86256 [2019-09-10 07:13:58,642 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:13:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86256 states. [2019-09-10 07:14:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86256 to 28006. [2019-09-10 07:14:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28006 states. [2019-09-10 07:14:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28006 states to 28006 states and 39370 transitions. [2019-09-10 07:14:00,210 INFO L78 Accepts]: Start accepts. Automaton has 28006 states and 39370 transitions. Word has length 84 [2019-09-10 07:14:00,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:00,210 INFO L475 AbstractCegarLoop]: Abstraction has 28006 states and 39370 transitions. [2019-09-10 07:14:00,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 28006 states and 39370 transitions. [2019-09-10 07:14:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:14:00,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:00,219 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:14:00,220 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:00,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:00,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1538841626, now seen corresponding path program 1 times [2019-09-10 07:14:00,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:00,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:00,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:00,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:00,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:00,345 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:00,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:00,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:14:00,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:00,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:14:00,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:14:00,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:14:00,347 INFO L87 Difference]: Start difference. First operand 28006 states and 39370 transitions. Second operand 4 states. [2019-09-10 07:14:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:00,501 INFO L93 Difference]: Finished difference Result 45772 states and 65299 transitions. [2019-09-10 07:14:00,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:14:00,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-10 07:14:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:00,560 INFO L225 Difference]: With dead ends: 45772 [2019-09-10 07:14:00,560 INFO L226 Difference]: Without dead ends: 45772 [2019-09-10 07:14:00,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:14:00,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45772 states. [2019-09-10 07:14:00,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45772 to 28004. [2019-09-10 07:14:00,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28004 states. [2019-09-10 07:14:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28004 states to 28004 states and 39297 transitions. [2019-09-10 07:14:00,977 INFO L78 Accepts]: Start accepts. Automaton has 28004 states and 39297 transitions. Word has length 85 [2019-09-10 07:14:00,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:00,977 INFO L475 AbstractCegarLoop]: Abstraction has 28004 states and 39297 transitions. [2019-09-10 07:14:00,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:14:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 28004 states and 39297 transitions. [2019-09-10 07:14:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:14:00,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:00,987 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:14:00,988 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:00,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1051434301, now seen corresponding path program 1 times [2019-09-10 07:14:00,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:00,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:00,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:00,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:00,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:01,096 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:01,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:01,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:14:01,096 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:01,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:14:01,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:14:01,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:14:01,098 INFO L87 Difference]: Start difference. First operand 28004 states and 39297 transitions. Second operand 4 states. [2019-09-10 07:14:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:01,237 INFO L93 Difference]: Finished difference Result 45770 states and 65244 transitions. [2019-09-10 07:14:01,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:14:01,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-10 07:14:01,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:01,300 INFO L225 Difference]: With dead ends: 45770 [2019-09-10 07:14:01,300 INFO L226 Difference]: Without dead ends: 45770 [2019-09-10 07:14:01,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:14:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45770 states. [2019-09-10 07:14:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45770 to 28002. [2019-09-10 07:14:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28002 states. [2019-09-10 07:14:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28002 states to 28002 states and 39242 transitions. [2019-09-10 07:14:01,975 INFO L78 Accepts]: Start accepts. Automaton has 28002 states and 39242 transitions. Word has length 85 [2019-09-10 07:14:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:01,976 INFO L475 AbstractCegarLoop]: Abstraction has 28002 states and 39242 transitions. [2019-09-10 07:14:01,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:14:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 28002 states and 39242 transitions. [2019-09-10 07:14:01,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:14:01,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:01,994 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:14:01,994 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash 262116288, now seen corresponding path program 1 times [2019-09-10 07:14:01,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:01,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:01,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:01,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:02,564 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:02,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:02,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:14:02,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:02,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:14:02,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:14:02,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:14:02,566 INFO L87 Difference]: Start difference. First operand 28002 states and 39242 transitions. Second operand 9 states. [2019-09-10 07:14:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:05,872 INFO L93 Difference]: Finished difference Result 96388 states and 137903 transitions. [2019-09-10 07:14:05,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:14:05,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 07:14:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:05,970 INFO L225 Difference]: With dead ends: 96388 [2019-09-10 07:14:05,970 INFO L226 Difference]: Without dead ends: 96388 [2019-09-10 07:14:05,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:14:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96388 states. [2019-09-10 07:14:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96388 to 28002. [2019-09-10 07:14:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28002 states. [2019-09-10 07:14:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28002 states to 28002 states and 39226 transitions. [2019-09-10 07:14:06,718 INFO L78 Accepts]: Start accepts. Automaton has 28002 states and 39226 transitions. Word has length 87 [2019-09-10 07:14:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:06,718 INFO L475 AbstractCegarLoop]: Abstraction has 28002 states and 39226 transitions. [2019-09-10 07:14:06,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:14:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 28002 states and 39226 transitions. [2019-09-10 07:14:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:14:06,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:06,733 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:14:06,734 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:06,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:06,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1529995204, now seen corresponding path program 1 times [2019-09-10 07:14:06,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:06,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:06,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:06,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:06,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:06,854 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:06,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:06,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:14:06,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:06,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:14:06,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:14:06,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:14:06,856 INFO L87 Difference]: Start difference. First operand 28002 states and 39226 transitions. Second operand 4 states. [2019-09-10 07:14:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:07,011 INFO L93 Difference]: Finished difference Result 45768 states and 65119 transitions. [2019-09-10 07:14:07,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:14:07,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-10 07:14:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:07,871 INFO L225 Difference]: With dead ends: 45768 [2019-09-10 07:14:07,872 INFO L226 Difference]: Without dead ends: 45768 [2019-09-10 07:14:07,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:14:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45768 states. [2019-09-10 07:14:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45768 to 28000. [2019-09-10 07:14:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28000 states. [2019-09-10 07:14:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28000 states to 28000 states and 39117 transitions. [2019-09-10 07:14:08,383 INFO L78 Accepts]: Start accepts. Automaton has 28000 states and 39117 transitions. Word has length 87 [2019-09-10 07:14:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:08,384 INFO L475 AbstractCegarLoop]: Abstraction has 28000 states and 39117 transitions. [2019-09-10 07:14:08,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:14:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 28000 states and 39117 transitions. [2019-09-10 07:14:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:14:08,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:08,403 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:14:08,404 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:08,404 INFO L82 PathProgramCache]: Analyzing trace with hash 408736059, now seen corresponding path program 1 times [2019-09-10 07:14:08,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:08,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:08,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:08,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:08,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:08,564 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:08,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:08,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:08,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:08,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:08,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:08,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:08,567 INFO L87 Difference]: Start difference. First operand 28000 states and 39117 transitions. Second operand 7 states. [2019-09-10 07:14:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:10,740 INFO L93 Difference]: Finished difference Result 93576 states and 133338 transitions. [2019-09-10 07:14:10,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:14:10,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:14:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:10,862 INFO L225 Difference]: With dead ends: 93576 [2019-09-10 07:14:10,863 INFO L226 Difference]: Without dead ends: 93576 [2019-09-10 07:14:10,863 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:14:10,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93576 states. [2019-09-10 07:14:11,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93576 to 28120. [2019-09-10 07:14:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28120 states. [2019-09-10 07:14:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28120 states to 28120 states and 39277 transitions. [2019-09-10 07:14:11,596 INFO L78 Accepts]: Start accepts. Automaton has 28120 states and 39277 transitions. Word has length 88 [2019-09-10 07:14:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:11,596 INFO L475 AbstractCegarLoop]: Abstraction has 28120 states and 39277 transitions. [2019-09-10 07:14:11,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 28120 states and 39277 transitions. [2019-09-10 07:14:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:14:11,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:11,610 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:14:11,610 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:11,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:11,611 INFO L82 PathProgramCache]: Analyzing trace with hash -713841947, now seen corresponding path program 1 times [2019-09-10 07:14:11,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:11,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:11,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:11,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:11,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:12,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:12,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:14:12,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:12,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:14:12,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:14:12,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:14:12,287 INFO L87 Difference]: Start difference. First operand 28120 states and 39277 transitions. Second operand 12 states. [2019-09-10 07:14:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:14,083 INFO L93 Difference]: Finished difference Result 98880 states and 141838 transitions. [2019-09-10 07:14:14,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:14:14,084 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-09-10 07:14:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:14,223 INFO L225 Difference]: With dead ends: 98880 [2019-09-10 07:14:14,223 INFO L226 Difference]: Without dead ends: 98880 [2019-09-10 07:14:14,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:14:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98880 states. [2019-09-10 07:14:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98880 to 27188. [2019-09-10 07:14:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27188 states. [2019-09-10 07:14:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27188 states to 27188 states and 38041 transitions. [2019-09-10 07:14:14,968 INFO L78 Accepts]: Start accepts. Automaton has 27188 states and 38041 transitions. Word has length 88 [2019-09-10 07:14:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:14,968 INFO L475 AbstractCegarLoop]: Abstraction has 27188 states and 38041 transitions. [2019-09-10 07:14:14,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:14:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 27188 states and 38041 transitions. [2019-09-10 07:14:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:14:14,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:14,980 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:14:14,980 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1770702308, now seen corresponding path program 1 times [2019-09-10 07:14:14,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:14,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:14,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:15,271 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:15,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:15,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:14:15,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:15,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:14:15,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:14:15,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:14:15,273 INFO L87 Difference]: Start difference. First operand 27188 states and 38041 transitions. Second operand 10 states. [2019-09-10 07:14:20,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:20,383 INFO L93 Difference]: Finished difference Result 111862 states and 158995 transitions. [2019-09-10 07:14:20,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:14:20,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-09-10 07:14:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:20,535 INFO L225 Difference]: With dead ends: 111862 [2019-09-10 07:14:20,535 INFO L226 Difference]: Without dead ends: 111862 [2019-09-10 07:14:20,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:14:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111862 states. [2019-09-10 07:14:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111862 to 27192. [2019-09-10 07:14:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27192 states. [2019-09-10 07:14:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27192 states to 27192 states and 38044 transitions. [2019-09-10 07:14:21,631 INFO L78 Accepts]: Start accepts. Automaton has 27192 states and 38044 transitions. Word has length 88 [2019-09-10 07:14:21,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:21,631 INFO L475 AbstractCegarLoop]: Abstraction has 27192 states and 38044 transitions. [2019-09-10 07:14:21,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:14:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 27192 states and 38044 transitions. [2019-09-10 07:14:21,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:14:21,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:21,641 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:14:21,642 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:21,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:21,642 INFO L82 PathProgramCache]: Analyzing trace with hash -476536620, now seen corresponding path program 1 times [2019-09-10 07:14:21,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:21,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:21,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:21,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:21,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:21,768 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:21,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:21,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:21,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:21,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:21,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:21,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:21,770 INFO L87 Difference]: Start difference. First operand 27192 states and 38044 transitions. Second operand 7 states. [2019-09-10 07:14:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:23,689 INFO L93 Difference]: Finished difference Result 105178 states and 150308 transitions. [2019-09-10 07:14:23,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:14:23,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 07:14:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:23,833 INFO L225 Difference]: With dead ends: 105178 [2019-09-10 07:14:23,833 INFO L226 Difference]: Without dead ends: 105178 [2019-09-10 07:14:23,834 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:14:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105178 states. [2019-09-10 07:14:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105178 to 27252. [2019-09-10 07:14:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27252 states. [2019-09-10 07:14:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27252 states to 27252 states and 38124 transitions. [2019-09-10 07:14:24,754 INFO L78 Accepts]: Start accepts. Automaton has 27252 states and 38124 transitions. Word has length 88 [2019-09-10 07:14:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:24,754 INFO L475 AbstractCegarLoop]: Abstraction has 27252 states and 38124 transitions. [2019-09-10 07:14:24,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 27252 states and 38124 transitions. [2019-09-10 07:14:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 07:14:24,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:24,767 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:14:24,767 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1162866559, now seen corresponding path program 1 times [2019-09-10 07:14:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:24,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:24,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:24,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:24,972 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:24,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:24,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:14:24,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:24,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:14:24,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:14:24,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:14:24,974 INFO L87 Difference]: Start difference. First operand 27252 states and 38124 transitions. Second operand 9 states. [2019-09-10 07:14:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:28,065 INFO L93 Difference]: Finished difference Result 96317 states and 137749 transitions. [2019-09-10 07:14:28,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:14:28,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 07:14:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:28,168 INFO L225 Difference]: With dead ends: 96317 [2019-09-10 07:14:28,169 INFO L226 Difference]: Without dead ends: 96317 [2019-09-10 07:14:28,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:14:28,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96317 states. [2019-09-10 07:14:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96317 to 27218. [2019-09-10 07:14:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27218 states. [2019-09-10 07:14:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27218 states to 27218 states and 38072 transitions. [2019-09-10 07:14:28,973 INFO L78 Accepts]: Start accepts. Automaton has 27218 states and 38072 transitions. Word has length 88 [2019-09-10 07:14:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:28,973 INFO L475 AbstractCegarLoop]: Abstraction has 27218 states and 38072 transitions. [2019-09-10 07:14:28,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:14:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 27218 states and 38072 transitions. [2019-09-10 07:14:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:28,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:28,985 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:14:28,985 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:28,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2079834142, now seen corresponding path program 1 times [2019-09-10 07:14:28,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:28,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:28,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:28,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:28,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:29,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:29,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:14:29,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:29,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:14:29,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:14:29,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:14:29,229 INFO L87 Difference]: Start difference. First operand 27218 states and 38072 transitions. Second operand 10 states. [2019-09-10 07:14:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:34,341 INFO L93 Difference]: Finished difference Result 120082 states and 170922 transitions. [2019-09-10 07:14:34,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:14:34,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-10 07:14:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:34,489 INFO L225 Difference]: With dead ends: 120082 [2019-09-10 07:14:34,489 INFO L226 Difference]: Without dead ends: 120082 [2019-09-10 07:14:34,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 07:14:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120082 states. [2019-09-10 07:14:35,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120082 to 27214. [2019-09-10 07:14:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27214 states. [2019-09-10 07:14:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27214 states to 27214 states and 38064 transitions. [2019-09-10 07:14:35,672 INFO L78 Accepts]: Start accepts. Automaton has 27214 states and 38064 transitions. Word has length 89 [2019-09-10 07:14:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:35,672 INFO L475 AbstractCegarLoop]: Abstraction has 27214 states and 38064 transitions. [2019-09-10 07:14:35,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:14:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 27214 states and 38064 transitions. [2019-09-10 07:14:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:35,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:35,683 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:14:35,684 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash 46798084, now seen corresponding path program 1 times [2019-09-10 07:14:35,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:35,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:35,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:35,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:35,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:36,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:36,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:14:36,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:36,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:14:36,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:14:36,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:14:36,415 INFO L87 Difference]: Start difference. First operand 27214 states and 38064 transitions. Second operand 15 states. [2019-09-10 07:14:37,258 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-10 07:14:37,542 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 07:14:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:42,731 INFO L93 Difference]: Finished difference Result 185053 states and 267378 transitions. [2019-09-10 07:14:42,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 07:14:42,732 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2019-09-10 07:14:42,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:42,982 INFO L225 Difference]: With dead ends: 185053 [2019-09-10 07:14:42,982 INFO L226 Difference]: Without dead ends: 185053 [2019-09-10 07:14:42,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=269, Invalid=921, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:14:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185053 states. [2019-09-10 07:14:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185053 to 27190. [2019-09-10 07:14:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27190 states. [2019-09-10 07:14:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27190 states to 27190 states and 38016 transitions. [2019-09-10 07:14:44,190 INFO L78 Accepts]: Start accepts. Automaton has 27190 states and 38016 transitions. Word has length 89 [2019-09-10 07:14:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:44,191 INFO L475 AbstractCegarLoop]: Abstraction has 27190 states and 38016 transitions. [2019-09-10 07:14:44,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:14:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 27190 states and 38016 transitions. [2019-09-10 07:14:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:44,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:44,202 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:14:44,202 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:44,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:44,202 INFO L82 PathProgramCache]: Analyzing trace with hash 662760208, now seen corresponding path program 1 times [2019-09-10 07:14:44,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:44,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:44,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:44,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:44,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:44,363 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:44,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:44,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:44,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:44,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:44,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:44,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:44,365 INFO L87 Difference]: Start difference. First operand 27190 states and 38016 transitions. Second operand 7 states. [2019-09-10 07:14:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:46,592 INFO L93 Difference]: Finished difference Result 92778 states and 132245 transitions. [2019-09-10 07:14:46,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:14:46,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-10 07:14:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:46,726 INFO L225 Difference]: With dead ends: 92778 [2019-09-10 07:14:46,726 INFO L226 Difference]: Without dead ends: 92778 [2019-09-10 07:14:46,727 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:14:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92778 states. [2019-09-10 07:14:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92778 to 27446. [2019-09-10 07:14:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27446 states. [2019-09-10 07:14:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27446 states to 27446 states and 38362 transitions. [2019-09-10 07:14:47,493 INFO L78 Accepts]: Start accepts. Automaton has 27446 states and 38362 transitions. Word has length 89 [2019-09-10 07:14:47,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:47,494 INFO L475 AbstractCegarLoop]: Abstraction has 27446 states and 38362 transitions. [2019-09-10 07:14:47,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27446 states and 38362 transitions. [2019-09-10 07:14:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 07:14:47,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:47,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, 1, 1, 1, 1] [2019-09-10 07:14:47,510 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:47,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1069989877, now seen corresponding path program 1 times [2019-09-10 07:14:47,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:47,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:47,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:47,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:47,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:47,963 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:47,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:47,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:14:47,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:47,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:14:47,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:14:47,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:14:47,964 INFO L87 Difference]: Start difference. First operand 27446 states and 38362 transitions. Second operand 13 states. [2019-09-10 07:14:48,468 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-09-10 07:14:48,595 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:14:48,769 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:14:49,306 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-09-10 07:14:49,664 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2019-09-10 07:14:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:50,575 INFO L93 Difference]: Finished difference Result 156351 states and 224941 transitions. [2019-09-10 07:14:50,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:14:50,575 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 89 [2019-09-10 07:14:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:50,802 INFO L225 Difference]: With dead ends: 156351 [2019-09-10 07:14:50,802 INFO L226 Difference]: Without dead ends: 156351 [2019-09-10 07:14:50,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:14:50,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156351 states. [2019-09-10 07:14:51,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156351 to 26524. [2019-09-10 07:14:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26524 states. [2019-09-10 07:14:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26524 states to 26524 states and 37134 transitions. [2019-09-10 07:14:51,837 INFO L78 Accepts]: Start accepts. Automaton has 26524 states and 37134 transitions. Word has length 89 [2019-09-10 07:14:51,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:51,837 INFO L475 AbstractCegarLoop]: Abstraction has 26524 states and 37134 transitions. [2019-09-10 07:14:51,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:14:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 26524 states and 37134 transitions. [2019-09-10 07:14:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:14:51,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:51,850 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:14:51,850 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:51,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:51,850 INFO L82 PathProgramCache]: Analyzing trace with hash 834761733, now seen corresponding path program 1 times [2019-09-10 07:14:51,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:51,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:51,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:51,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:51,986 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:51,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:51,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:51,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:51,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:51,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:51,989 INFO L87 Difference]: Start difference. First operand 26524 states and 37134 transitions. Second operand 7 states. [2019-09-10 07:14:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:53,956 INFO L93 Difference]: Finished difference Result 107294 states and 153440 transitions. [2019-09-10 07:14:53,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:14:53,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:14:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:54,091 INFO L225 Difference]: With dead ends: 107294 [2019-09-10 07:14:54,091 INFO L226 Difference]: Without dead ends: 107294 [2019-09-10 07:14:54,092 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:14:54,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107294 states. [2019-09-10 07:14:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107294 to 26599. [2019-09-10 07:14:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26599 states. [2019-09-10 07:14:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26599 states to 26599 states and 37234 transitions. [2019-09-10 07:14:55,001 INFO L78 Accepts]: Start accepts. Automaton has 26599 states and 37234 transitions. Word has length 90 [2019-09-10 07:14:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:55,001 INFO L475 AbstractCegarLoop]: Abstraction has 26599 states and 37234 transitions. [2019-09-10 07:14:55,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 26599 states and 37234 transitions. [2019-09-10 07:14:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:14:55,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:55,012 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:14:55,013 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:55,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:55,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1914506380, now seen corresponding path program 1 times [2019-09-10 07:14:55,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:55,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:55,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:55,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:55,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:55,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:55,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:14:55,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:55,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:14:55,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:14:55,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:14:55,126 INFO L87 Difference]: Start difference. First operand 26599 states and 37234 transitions. Second operand 7 states. [2019-09-10 07:14:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:14:56,918 INFO L93 Difference]: Finished difference Result 104928 states and 149934 transitions. [2019-09-10 07:14:56,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:14:56,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-10 07:14:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:14:57,045 INFO L225 Difference]: With dead ends: 104928 [2019-09-10 07:14:57,046 INFO L226 Difference]: Without dead ends: 104928 [2019-09-10 07:14:57,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:14:57,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104928 states. [2019-09-10 07:14:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104928 to 26747. [2019-09-10 07:14:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26747 states. [2019-09-10 07:14:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26747 states to 26747 states and 37432 transitions. [2019-09-10 07:14:57,841 INFO L78 Accepts]: Start accepts. Automaton has 26747 states and 37432 transitions. Word has length 90 [2019-09-10 07:14:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:57,841 INFO L475 AbstractCegarLoop]: Abstraction has 26747 states and 37432 transitions. [2019-09-10 07:14:57,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:14:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 26747 states and 37432 transitions. [2019-09-10 07:14:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:14:57,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:57,852 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:14:57,853 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:57,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:57,853 INFO L82 PathProgramCache]: Analyzing trace with hash -635596779, now seen corresponding path program 1 times [2019-09-10 07:14:57,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:57,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:57,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:57,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:57,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:58,068 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:58,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:14:58,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:14:58,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:58,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:14:58,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:14:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:14:58,073 INFO L87 Difference]: Start difference. First operand 26747 states and 37432 transitions. Second operand 10 states. [2019-09-10 07:15:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:01,378 INFO L93 Difference]: Finished difference Result 101960 states and 145924 transitions. [2019-09-10 07:15:01,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:15:01,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-10 07:15:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:01,515 INFO L225 Difference]: With dead ends: 101960 [2019-09-10 07:15:01,515 INFO L226 Difference]: Without dead ends: 101960 [2019-09-10 07:15:01,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:15:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101960 states. [2019-09-10 07:15:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101960 to 26176. [2019-09-10 07:15:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26176 states. [2019-09-10 07:15:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26176 states to 26176 states and 36652 transitions. [2019-09-10 07:15:02,253 INFO L78 Accepts]: Start accepts. Automaton has 26176 states and 36652 transitions. Word has length 90 [2019-09-10 07:15:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:02,254 INFO L475 AbstractCegarLoop]: Abstraction has 26176 states and 36652 transitions. [2019-09-10 07:15:02,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:15:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 26176 states and 36652 transitions. [2019-09-10 07:15:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 07:15:02,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:02,265 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:15:02,266 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:02,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:02,266 INFO L82 PathProgramCache]: Analyzing trace with hash 543181299, now seen corresponding path program 1 times [2019-09-10 07:15:02,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:02,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:02,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:02,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:02,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:02,454 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:02,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:02,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:15:02,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:02,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:15:02,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:15:02,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:15:02,455 INFO L87 Difference]: Start difference. First operand 26176 states and 36652 transitions. Second operand 9 states. [2019-09-10 07:15:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:05,156 INFO L93 Difference]: Finished difference Result 94784 states and 136778 transitions. [2019-09-10 07:15:05,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:15:05,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2019-09-10 07:15:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:05,281 INFO L225 Difference]: With dead ends: 94784 [2019-09-10 07:15:05,282 INFO L226 Difference]: Without dead ends: 94784 [2019-09-10 07:15:05,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:15:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94784 states. [2019-09-10 07:15:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94784 to 26093. [2019-09-10 07:15:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26093 states. [2019-09-10 07:15:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26093 states to 26093 states and 36531 transitions. [2019-09-10 07:15:06,074 INFO L78 Accepts]: Start accepts. Automaton has 26093 states and 36531 transitions. Word has length 90 [2019-09-10 07:15:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:06,074 INFO L475 AbstractCegarLoop]: Abstraction has 26093 states and 36531 transitions. [2019-09-10 07:15:06,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:15:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand 26093 states and 36531 transitions. [2019-09-10 07:15:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:15:06,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:06,086 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:15:06,087 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1769643837, now seen corresponding path program 1 times [2019-09-10 07:15:06,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:06,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:06,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:06,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:07,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:07,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:15:07,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:07,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:15:07,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:15:07,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:15:07,282 INFO L87 Difference]: Start difference. First operand 26093 states and 36531 transitions. Second operand 18 states. [2019-09-10 07:15:07,423 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 07:15:07,869 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-10 07:15:08,245 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 07:15:08,597 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 07:15:09,168 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2019-09-10 07:15:10,145 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-10 07:15:11,200 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:15:11,816 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:15:12,144 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-09-10 07:15:12,421 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-10 07:15:12,970 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 07:15:13,320 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-10 07:15:13,561 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 07:15:15,926 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:15:16,322 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-10 07:15:17,477 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 07:15:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:17,681 INFO L93 Difference]: Finished difference Result 152336 states and 219583 transitions. [2019-09-10 07:15:17,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:15:17,682 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2019-09-10 07:15:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:17,909 INFO L225 Difference]: With dead ends: 152336 [2019-09-10 07:15:17,909 INFO L226 Difference]: Without dead ends: 152336 [2019-09-10 07:15:17,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=386, Invalid=1336, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 07:15:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152336 states. [2019-09-10 07:15:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152336 to 26143. [2019-09-10 07:15:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26143 states. [2019-09-10 07:15:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26143 states to 26143 states and 36602 transitions. [2019-09-10 07:15:18,844 INFO L78 Accepts]: Start accepts. Automaton has 26143 states and 36602 transitions. Word has length 91 [2019-09-10 07:15:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:18,845 INFO L475 AbstractCegarLoop]: Abstraction has 26143 states and 36602 transitions. [2019-09-10 07:15:18,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:15:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 26143 states and 36602 transitions. [2019-09-10 07:15:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 07:15:18,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:18,857 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:15:18,857 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:18,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1250919733, now seen corresponding path program 1 times [2019-09-10 07:15:18,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:18,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:18,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:18,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:18,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:19,359 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:19,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:19,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:15:19,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:19,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:15:19,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:15:19,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:15:19,362 INFO L87 Difference]: Start difference. First operand 26143 states and 36602 transitions. Second operand 13 states. [2019-09-10 07:15:19,828 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:15:20,030 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:15:20,617 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-10 07:15:20,768 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 07:15:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:21,604 INFO L93 Difference]: Finished difference Result 136667 states and 196973 transitions. [2019-09-10 07:15:21,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 07:15:21,605 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2019-09-10 07:15:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:21,794 INFO L225 Difference]: With dead ends: 136667 [2019-09-10 07:15:21,794 INFO L226 Difference]: Without dead ends: 136667 [2019-09-10 07:15:21,795 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:15:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136667 states. [2019-09-10 07:15:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136667 to 25887. [2019-09-10 07:15:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25887 states. [2019-09-10 07:15:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25887 states to 25887 states and 36237 transitions. [2019-09-10 07:15:22,920 INFO L78 Accepts]: Start accepts. Automaton has 25887 states and 36237 transitions. Word has length 91 [2019-09-10 07:15:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:22,920 INFO L475 AbstractCegarLoop]: Abstraction has 25887 states and 36237 transitions. [2019-09-10 07:15:22,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:15:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 25887 states and 36237 transitions. [2019-09-10 07:15:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:15:22,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:22,933 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:15:22,933 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:22,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:22,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1260540226, now seen corresponding path program 1 times [2019-09-10 07:15:22,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:22,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:22,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:22,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:23,123 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,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:23,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:15:23,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:23,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:15:23,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:15:23,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:15:23,127 INFO L87 Difference]: Start difference. First operand 25887 states and 36237 transitions. Second operand 9 states. [2019-09-10 07:15:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:25,745 INFO L93 Difference]: Finished difference Result 93568 states and 134030 transitions. [2019-09-10 07:15:25,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:15:25,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:15:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:25,843 INFO L225 Difference]: With dead ends: 93568 [2019-09-10 07:15:25,843 INFO L226 Difference]: Without dead ends: 93568 [2019-09-10 07:15:25,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:15:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93568 states. [2019-09-10 07:15:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93568 to 25869. [2019-09-10 07:15:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25869 states. [2019-09-10 07:15:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25869 states to 25869 states and 36201 transitions. [2019-09-10 07:15:26,519 INFO L78 Accepts]: Start accepts. Automaton has 25869 states and 36201 transitions. Word has length 92 [2019-09-10 07:15:26,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:26,519 INFO L475 AbstractCegarLoop]: Abstraction has 25869 states and 36201 transitions. [2019-09-10 07:15:26,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:15:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 25869 states and 36201 transitions. [2019-09-10 07:15:26,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:15:26,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:26,532 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:15:26,532 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:26,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1755517469, now seen corresponding path program 1 times [2019-09-10 07:15:26,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:26,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:26,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:26,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:26,688 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:26,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:26,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:15:26,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:26,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:15:26,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:15:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:15:26,690 INFO L87 Difference]: Start difference. First operand 25869 states and 36201 transitions. Second operand 9 states. [2019-09-10 07:15:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:29,459 INFO L93 Difference]: Finished difference Result 94448 states and 135156 transitions. [2019-09-10 07:15:29,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:15:29,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-10 07:15:29,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:29,572 INFO L225 Difference]: With dead ends: 94448 [2019-09-10 07:15:29,572 INFO L226 Difference]: Without dead ends: 94448 [2019-09-10 07:15:29,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:15:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94448 states. [2019-09-10 07:15:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94448 to 25941. [2019-09-10 07:15:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25941 states. [2019-09-10 07:15:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25941 states to 25941 states and 36264 transitions. [2019-09-10 07:15:30,301 INFO L78 Accepts]: Start accepts. Automaton has 25941 states and 36264 transitions. Word has length 92 [2019-09-10 07:15:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:30,302 INFO L475 AbstractCegarLoop]: Abstraction has 25941 states and 36264 transitions. [2019-09-10 07:15:30,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:15:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 25941 states and 36264 transitions. [2019-09-10 07:15:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 07:15:30,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:30,314 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:15:30,315 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:30,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:30,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2009956631, now seen corresponding path program 1 times [2019-09-10 07:15:30,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:30,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:30,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:30,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:30,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:30,399 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:30,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:30,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:30,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:30,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:30,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:30,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:30,401 INFO L87 Difference]: Start difference. First operand 25941 states and 36264 transitions. Second operand 3 states. [2019-09-10 07:15:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:30,497 INFO L93 Difference]: Finished difference Result 25943 states and 35998 transitions. [2019-09-10 07:15:30,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:30,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 07:15:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:30,522 INFO L225 Difference]: With dead ends: 25943 [2019-09-10 07:15:30,522 INFO L226 Difference]: Without dead ends: 25943 [2019-09-10 07:15:30,522 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:15:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25943 states. [2019-09-10 07:15:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25943 to 25941. [2019-09-10 07:15:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25941 states. [2019-09-10 07:15:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25941 states to 25941 states and 35997 transitions. [2019-09-10 07:15:30,870 INFO L78 Accepts]: Start accepts. Automaton has 25941 states and 35997 transitions. Word has length 92 [2019-09-10 07:15:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:30,870 INFO L475 AbstractCegarLoop]: Abstraction has 25941 states and 35997 transitions. [2019-09-10 07:15:30,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 25941 states and 35997 transitions. [2019-09-10 07:15:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:15:30,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:30,883 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:15:30,883 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1582916393, now seen corresponding path program 1 times [2019-09-10 07:15:30,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:30,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:30,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:30,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:30,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:30,967 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:30,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:30,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:30,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:30,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:30,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:30,969 INFO L87 Difference]: Start difference. First operand 25941 states and 35997 transitions. Second operand 3 states. [2019-09-10 07:15:31,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:31,093 INFO L93 Difference]: Finished difference Result 25933 states and 35684 transitions. [2019-09-10 07:15:31,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:31,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 07:15:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:31,127 INFO L225 Difference]: With dead ends: 25933 [2019-09-10 07:15:31,127 INFO L226 Difference]: Without dead ends: 25933 [2019-09-10 07:15:31,128 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:15:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25933 states. [2019-09-10 07:15:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25933 to 25931. [2019-09-10 07:15:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25931 states. [2019-09-10 07:15:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25931 states to 25931 states and 35683 transitions. [2019-09-10 07:15:31,372 INFO L78 Accepts]: Start accepts. Automaton has 25931 states and 35683 transitions. Word has length 93 [2019-09-10 07:15:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:31,372 INFO L475 AbstractCegarLoop]: Abstraction has 25931 states and 35683 transitions. [2019-09-10 07:15:31,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 25931 states and 35683 transitions. [2019-09-10 07:15:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:15:31,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:31,385 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:31,385 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:31,385 INFO L82 PathProgramCache]: Analyzing trace with hash 102196763, now seen corresponding path program 1 times [2019-09-10 07:15:31,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:31,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:31,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:31,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:31,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:31,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:31,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:31,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:31,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:31,474 INFO L87 Difference]: Start difference. First operand 25931 states and 35683 transitions. Second operand 3 states. [2019-09-10 07:15:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:31,634 INFO L93 Difference]: Finished difference Result 25933 states and 35298 transitions. [2019-09-10 07:15:31,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:31,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 07:15:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:31,662 INFO L225 Difference]: With dead ends: 25933 [2019-09-10 07:15:31,662 INFO L226 Difference]: Without dead ends: 25933 [2019-09-10 07:15:31,663 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:15:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25933 states. [2019-09-10 07:15:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25933 to 25931. [2019-09-10 07:15:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25931 states. [2019-09-10 07:15:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25931 states to 25931 states and 35297 transitions. [2019-09-10 07:15:31,911 INFO L78 Accepts]: Start accepts. Automaton has 25931 states and 35297 transitions. Word has length 93 [2019-09-10 07:15:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:31,911 INFO L475 AbstractCegarLoop]: Abstraction has 25931 states and 35297 transitions. [2019-09-10 07:15:31,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 25931 states and 35297 transitions. [2019-09-10 07:15:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:15:31,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:31,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, 1] [2019-09-10 07:15:31,925 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:31,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1260374874, now seen corresponding path program 1 times [2019-09-10 07:15:31,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:31,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:31,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:31,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:31,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:31,981 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:31,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:31,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:31,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:31,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:31,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:31,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:31,982 INFO L87 Difference]: Start difference. First operand 25931 states and 35297 transitions. Second operand 3 states. [2019-09-10 07:15:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:32,126 INFO L93 Difference]: Finished difference Result 31200 states and 42727 transitions. [2019-09-10 07:15:32,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:32,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 07:15:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:32,157 INFO L225 Difference]: With dead ends: 31200 [2019-09-10 07:15:32,157 INFO L226 Difference]: Without dead ends: 31200 [2019-09-10 07:15:32,157 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:15:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31200 states. [2019-09-10 07:15:32,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31200 to 24133. [2019-09-10 07:15:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24133 states. [2019-09-10 07:15:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24133 states to 24133 states and 32934 transitions. [2019-09-10 07:15:32,415 INFO L78 Accepts]: Start accepts. Automaton has 24133 states and 32934 transitions. Word has length 93 [2019-09-10 07:15:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:32,415 INFO L475 AbstractCegarLoop]: Abstraction has 24133 states and 32934 transitions. [2019-09-10 07:15:32,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 24133 states and 32934 transitions. [2019-09-10 07:15:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 07:15:32,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:32,427 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:15:32,427 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:32,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:32,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1356950489, now seen corresponding path program 1 times [2019-09-10 07:15:32,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:32,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:32,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:32,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:32,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:32,482 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:32,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:32,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:32,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:32,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:32,484 INFO L87 Difference]: Start difference. First operand 24133 states and 32934 transitions. Second operand 3 states. [2019-09-10 07:15:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:32,616 INFO L93 Difference]: Finished difference Result 33672 states and 46603 transitions. [2019-09-10 07:15:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:32,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 07:15:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:32,655 INFO L225 Difference]: With dead ends: 33672 [2019-09-10 07:15:32,655 INFO L226 Difference]: Without dead ends: 33672 [2019-09-10 07:15:32,655 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:15:32,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33672 states. [2019-09-10 07:15:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33672 to 23518. [2019-09-10 07:15:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23518 states. [2019-09-10 07:15:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23518 states to 23518 states and 32103 transitions. [2019-09-10 07:15:32,931 INFO L78 Accepts]: Start accepts. Automaton has 23518 states and 32103 transitions. Word has length 93 [2019-09-10 07:15:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:32,932 INFO L475 AbstractCegarLoop]: Abstraction has 23518 states and 32103 transitions. [2019-09-10 07:15:32,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:32,932 INFO L276 IsEmpty]: Start isEmpty. Operand 23518 states and 32103 transitions. [2019-09-10 07:15:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:15:32,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:32,944 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:32,945 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:32,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:32,945 INFO L82 PathProgramCache]: Analyzing trace with hash -787486713, now seen corresponding path program 1 times [2019-09-10 07:15:32,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:32,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:32,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:32,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:32,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:33,013 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:33,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:33,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:15:33,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:33,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:15:33,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:15:33,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:15:33,015 INFO L87 Difference]: Start difference. First operand 23518 states and 32103 transitions. Second operand 3 states. [2019-09-10 07:15:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:33,217 INFO L93 Difference]: Finished difference Result 28512 states and 39241 transitions. [2019-09-10 07:15:33,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:15:33,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 07:15:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:33,248 INFO L225 Difference]: With dead ends: 28512 [2019-09-10 07:15:33,248 INFO L226 Difference]: Without dead ends: 28512 [2019-09-10 07:15:33,248 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:15:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28512 states. [2019-09-10 07:15:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28512 to 22196. [2019-09-10 07:15:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22196 states. [2019-09-10 07:15:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22196 states to 22196 states and 30421 transitions. [2019-09-10 07:15:33,489 INFO L78 Accepts]: Start accepts. Automaton has 22196 states and 30421 transitions. Word has length 94 [2019-09-10 07:15:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:33,490 INFO L475 AbstractCegarLoop]: Abstraction has 22196 states and 30421 transitions. [2019-09-10 07:15:33,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:15:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 22196 states and 30421 transitions. [2019-09-10 07:15:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:15:33,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:33,501 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] [2019-09-10 07:15:33,501 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1641057236, now seen corresponding path program 1 times [2019-09-10 07:15:33,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:33,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:33,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:33,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:33,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:33,647 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:33,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:33,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:15:33,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:33,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:15:33,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:15:33,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:15:33,652 INFO L87 Difference]: Start difference. First operand 22196 states and 30421 transitions. Second operand 9 states. [2019-09-10 07:15:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:36,236 INFO L93 Difference]: Finished difference Result 64548 states and 90701 transitions. [2019-09-10 07:15:36,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:15:36,237 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 07:15:36,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:36,308 INFO L225 Difference]: With dead ends: 64548 [2019-09-10 07:15:36,308 INFO L226 Difference]: Without dead ends: 64548 [2019-09-10 07:15:36,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 07:15:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64548 states. [2019-09-10 07:15:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64548 to 22072. [2019-09-10 07:15:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22072 states. [2019-09-10 07:15:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22072 states to 22072 states and 30263 transitions. [2019-09-10 07:15:36,978 INFO L78 Accepts]: Start accepts. Automaton has 22072 states and 30263 transitions. Word has length 94 [2019-09-10 07:15:36,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:36,978 INFO L475 AbstractCegarLoop]: Abstraction has 22072 states and 30263 transitions. [2019-09-10 07:15:36,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:15:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 22072 states and 30263 transitions. [2019-09-10 07:15:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:15:36,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:36,991 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] [2019-09-10 07:15:36,991 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash 87538152, now seen corresponding path program 1 times [2019-09-10 07:15:36,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:36,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:36,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:36,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:36,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:37,137 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:37,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:37,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:15:37,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:37,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:15:37,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:15:37,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:15:37,138 INFO L87 Difference]: Start difference. First operand 22072 states and 30263 transitions. Second operand 9 states. [2019-09-10 07:15:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:39,747 INFO L93 Difference]: Finished difference Result 52038 states and 72290 transitions. [2019-09-10 07:15:39,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:15:39,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 07:15:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:39,808 INFO L225 Difference]: With dead ends: 52038 [2019-09-10 07:15:39,808 INFO L226 Difference]: Without dead ends: 52038 [2019-09-10 07:15:39,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:15:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52038 states. [2019-09-10 07:15:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52038 to 22054. [2019-09-10 07:15:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22054 states. [2019-09-10 07:15:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22054 states to 22054 states and 30235 transitions. [2019-09-10 07:15:40,211 INFO L78 Accepts]: Start accepts. Automaton has 22054 states and 30235 transitions. Word has length 94 [2019-09-10 07:15:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:40,212 INFO L475 AbstractCegarLoop]: Abstraction has 22054 states and 30235 transitions. [2019-09-10 07:15:40,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:15:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 22054 states and 30235 transitions. [2019-09-10 07:15:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:15:40,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:40,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, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:40,223 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:40,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:40,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1824917299, now seen corresponding path program 1 times [2019-09-10 07:15:40,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:40,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:40,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:40,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:40,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:40,667 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 07:15:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:15:40,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:40,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:15:40,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:40,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:15:40,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:15:40,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:15:40,911 INFO L87 Difference]: Start difference. First operand 22054 states and 30235 transitions. Second operand 13 states. [2019-09-10 07:15:41,693 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-09-10 07:15:41,894 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:15:42,101 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:15:42,307 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-10 07:15:42,475 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 07:15:43,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:43,386 INFO L93 Difference]: Finished difference Result 38616 states and 53464 transitions. [2019-09-10 07:15:43,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:15:43,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2019-09-10 07:15:43,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:43,429 INFO L225 Difference]: With dead ends: 38616 [2019-09-10 07:15:43,429 INFO L226 Difference]: Without dead ends: 38616 [2019-09-10 07:15:43,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:15:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38616 states. [2019-09-10 07:15:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38616 to 21966. [2019-09-10 07:15:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21966 states. [2019-09-10 07:15:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21966 states to 21966 states and 30121 transitions. [2019-09-10 07:15:43,713 INFO L78 Accepts]: Start accepts. Automaton has 21966 states and 30121 transitions. Word has length 95 [2019-09-10 07:15:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:43,713 INFO L475 AbstractCegarLoop]: Abstraction has 21966 states and 30121 transitions. [2019-09-10 07:15:43,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:15:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 21966 states and 30121 transitions. [2019-09-10 07:15:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:15:43,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:43,726 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] [2019-09-10 07:15:43,726 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:43,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1159408218, now seen corresponding path program 1 times [2019-09-10 07:15:43,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:43,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:43,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:43,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:43,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:44,723 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:44,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:44,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:15:44,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:44,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:15:44,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:15:44,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:15:44,725 INFO L87 Difference]: Start difference. First operand 21966 states and 30121 transitions. Second operand 18 states. [2019-09-10 07:15:45,535 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 34 [2019-09-10 07:15:46,381 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 50 [2019-09-10 07:15:46,731 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2019-09-10 07:15:46,960 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 07:15:47,251 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-10 07:15:47,570 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-10 07:15:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:49,933 INFO L93 Difference]: Finished difference Result 54655 states and 75593 transitions. [2019-09-10 07:15:49,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:15:49,934 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2019-09-10 07:15:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:49,994 INFO L225 Difference]: With dead ends: 54655 [2019-09-10 07:15:49,995 INFO L226 Difference]: Without dead ends: 54655 [2019-09-10 07:15:49,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:15:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54655 states. [2019-09-10 07:15:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54655 to 21955. [2019-09-10 07:15:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21955 states. [2019-09-10 07:15:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21955 states to 21955 states and 30108 transitions. [2019-09-10 07:15:50,468 INFO L78 Accepts]: Start accepts. Automaton has 21955 states and 30108 transitions. Word has length 95 [2019-09-10 07:15:50,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:50,469 INFO L475 AbstractCegarLoop]: Abstraction has 21955 states and 30108 transitions. [2019-09-10 07:15:50,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:15:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21955 states and 30108 transitions. [2019-09-10 07:15:50,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 07:15:50,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:50,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:15:50,481 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:50,482 INFO L82 PathProgramCache]: Analyzing trace with hash -954731541, now seen corresponding path program 1 times [2019-09-10 07:15:50,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:50,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:50,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:50,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:50,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:51,203 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:51,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:51,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 07:15:51,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:51,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:15:51,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:15:51,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-10 07:15:51,204 INFO L87 Difference]: Start difference. First operand 21955 states and 30108 transitions. Second operand 19 states. [2019-09-10 07:15:52,581 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2019-09-10 07:15:52,830 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 54 [2019-09-10 07:15:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:55,162 INFO L93 Difference]: Finished difference Result 57742 states and 80013 transitions. [2019-09-10 07:15:55,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:15:55,163 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 95 [2019-09-10 07:15:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:55,232 INFO L225 Difference]: With dead ends: 57742 [2019-09-10 07:15:55,232 INFO L226 Difference]: Without dead ends: 57742 [2019-09-10 07:15:55,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:15:55,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57742 states. [2019-09-10 07:15:55,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57742 to 21912. [2019-09-10 07:15:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21912 states. [2019-09-10 07:15:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21912 states to 21912 states and 30056 transitions. [2019-09-10 07:15:55,574 INFO L78 Accepts]: Start accepts. Automaton has 21912 states and 30056 transitions. Word has length 95 [2019-09-10 07:15:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:55,574 INFO L475 AbstractCegarLoop]: Abstraction has 21912 states and 30056 transitions. [2019-09-10 07:15:55,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 07:15:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 21912 states and 30056 transitions. [2019-09-10 07:15:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:15:55,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:55,586 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] [2019-09-10 07:15:55,586 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:55,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:55,586 INFO L82 PathProgramCache]: Analyzing trace with hash 498994437, now seen corresponding path program 1 times [2019-09-10 07:15:55,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:55,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:55,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:55,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:55,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:56,290 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:56,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:56,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:15:56,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:56,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:15:56,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:15:56,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:15:56,292 INFO L87 Difference]: Start difference. First operand 21912 states and 30056 transitions. Second operand 13 states. [2019-09-10 07:15:57,130 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2019-09-10 07:15:57,332 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 07:15:57,526 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 07:15:57,718 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2019-09-10 07:15:57,889 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-09-10 07:15:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:15:58,723 INFO L93 Difference]: Finished difference Result 36040 states and 49892 transitions. [2019-09-10 07:15:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:15:58,724 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-09-10 07:15:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:15:58,764 INFO L225 Difference]: With dead ends: 36040 [2019-09-10 07:15:58,765 INFO L226 Difference]: Without dead ends: 36040 [2019-09-10 07:15:58,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:15:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36040 states. [2019-09-10 07:15:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36040 to 21896. [2019-09-10 07:15:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2019-09-10 07:15:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 30038 transitions. [2019-09-10 07:15:59,055 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 30038 transitions. Word has length 96 [2019-09-10 07:15:59,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:15:59,055 INFO L475 AbstractCegarLoop]: Abstraction has 21896 states and 30038 transitions. [2019-09-10 07:15:59,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:15:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 30038 transitions. [2019-09-10 07:15:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 07:15:59,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:15:59,070 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] [2019-09-10 07:15:59,070 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:15:59,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:15:59,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1556821150, now seen corresponding path program 1 times [2019-09-10 07:15:59,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:15:59,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:59,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:15:59,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:15:59,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:15:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:15:59,465 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:59,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:15:59,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 07:15:59,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:15:59,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 07:15:59,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 07:15:59,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:15:59,466 INFO L87 Difference]: Start difference. First operand 21896 states and 30038 transitions. Second operand 11 states. [2019-09-10 07:16:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:00,606 INFO L93 Difference]: Finished difference Result 46205 states and 64606 transitions. [2019-09-10 07:16:00,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:16:00,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-09-10 07:16:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:00,648 INFO L225 Difference]: With dead ends: 46205 [2019-09-10 07:16:00,648 INFO L226 Difference]: Without dead ends: 46205 [2019-09-10 07:16:00,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:16:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46205 states. [2019-09-10 07:16:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46205 to 21842. [2019-09-10 07:16:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21842 states. [2019-09-10 07:16:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21842 states to 21842 states and 29962 transitions. [2019-09-10 07:16:00,911 INFO L78 Accepts]: Start accepts. Automaton has 21842 states and 29962 transitions. Word has length 96 [2019-09-10 07:16:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:00,912 INFO L475 AbstractCegarLoop]: Abstraction has 21842 states and 29962 transitions. [2019-09-10 07:16:00,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 07:16:00,912 INFO L276 IsEmpty]: Start isEmpty. Operand 21842 states and 29962 transitions. [2019-09-10 07:16:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:16:00,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:00,925 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:00,925 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:00,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:00,926 INFO L82 PathProgramCache]: Analyzing trace with hash 216875883, now seen corresponding path program 1 times [2019-09-10 07:16:00,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:00,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:00,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:00,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:01,127 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:16:01,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:01,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:01,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:01,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:01,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:01,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:01,129 INFO L87 Difference]: Start difference. First operand 21842 states and 29962 transitions. Second operand 3 states. [2019-09-10 07:16:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:01,214 INFO L93 Difference]: Finished difference Result 21844 states and 29747 transitions. [2019-09-10 07:16:01,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:01,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 07:16:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:01,242 INFO L225 Difference]: With dead ends: 21844 [2019-09-10 07:16:01,243 INFO L226 Difference]: Without dead ends: 21844 [2019-09-10 07:16:01,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:16:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21844 states. [2019-09-10 07:16:01,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21844 to 21842. [2019-09-10 07:16:01,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21842 states. [2019-09-10 07:16:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21842 states to 21842 states and 29746 transitions. [2019-09-10 07:16:01,485 INFO L78 Accepts]: Start accepts. Automaton has 21842 states and 29746 transitions. Word has length 99 [2019-09-10 07:16:01,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:01,485 INFO L475 AbstractCegarLoop]: Abstraction has 21842 states and 29746 transitions. [2019-09-10 07:16:01,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 21842 states and 29746 transitions. [2019-09-10 07:16:01,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:16:01,500 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:01,500 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:01,500 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash 10381906, now seen corresponding path program 1 times [2019-09-10 07:16:01,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:01,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:01,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:01,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:01,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:01,573 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:16:01,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:01,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:16:01,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:01,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:16:01,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:16:01,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:16:01,574 INFO L87 Difference]: Start difference. First operand 21842 states and 29746 transitions. Second operand 3 states. [2019-09-10 07:16:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:01,677 INFO L93 Difference]: Finished difference Result 26947 states and 36919 transitions. [2019-09-10 07:16:01,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:16:01,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:16:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:01,703 INFO L225 Difference]: With dead ends: 26947 [2019-09-10 07:16:01,703 INFO L226 Difference]: Without dead ends: 26947 [2019-09-10 07:16:01,703 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:16:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26947 states. [2019-09-10 07:16:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26947 to 20535. [2019-09-10 07:16:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20535 states. [2019-09-10 07:16:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20535 states to 20535 states and 28032 transitions. [2019-09-10 07:16:01,898 INFO L78 Accepts]: Start accepts. Automaton has 20535 states and 28032 transitions. Word has length 100 [2019-09-10 07:16:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:01,898 INFO L475 AbstractCegarLoop]: Abstraction has 20535 states and 28032 transitions. [2019-09-10 07:16:01,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:16:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 20535 states and 28032 transitions. [2019-09-10 07:16:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:16:01,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:01,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:01,915 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:01,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:01,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1704002596, now seen corresponding path program 1 times [2019-09-10 07:16:01,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:01,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:01,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:01,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:01,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:02,705 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-10 07:16:02,836 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 07:16:04,048 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:16:04,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:04,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 07:16:04,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:04,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 07:16:04,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 07:16:04,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:16:04,049 INFO L87 Difference]: Start difference. First operand 20535 states and 28032 transitions. Second operand 28 states. [2019-09-10 07:16:04,244 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 07:16:05,280 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 07:16:05,557 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 07:16:05,954 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 07:16:06,312 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-09-10 07:16:06,797 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 104 [2019-09-10 07:16:07,539 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 117 [2019-09-10 07:16:09,564 WARN L188 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 130 [2019-09-10 07:16:10,376 WARN L188 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 141 [2019-09-10 07:16:10,738 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-09-10 07:16:11,303 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-09-10 07:16:12,030 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-09-10 07:16:12,413 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-09-10 07:16:12,859 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-09-10 07:16:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:16:20,119 INFO L93 Difference]: Finished difference Result 46170 states and 63735 transitions. [2019-09-10 07:16:20,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 07:16:20,119 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2019-09-10 07:16:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:16:20,171 INFO L225 Difference]: With dead ends: 46170 [2019-09-10 07:16:20,171 INFO L226 Difference]: Without dead ends: 46170 [2019-09-10 07:16:20,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=536, Invalid=2116, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 07:16:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46170 states. [2019-09-10 07:16:20,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46170 to 20542. [2019-09-10 07:16:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20542 states. [2019-09-10 07:16:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20542 states to 20542 states and 28039 transitions. [2019-09-10 07:16:20,489 INFO L78 Accepts]: Start accepts. Automaton has 20542 states and 28039 transitions. Word has length 101 [2019-09-10 07:16:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:16:20,489 INFO L475 AbstractCegarLoop]: Abstraction has 20542 states and 28039 transitions. [2019-09-10 07:16:20,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 07:16:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 20542 states and 28039 transitions. [2019-09-10 07:16:20,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:16:20,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:16:20,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:16:20,507 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:16:20,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:16:20,507 INFO L82 PathProgramCache]: Analyzing trace with hash 62285937, now seen corresponding path program 1 times [2019-09-10 07:16:20,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:16:20,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:20,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:16:20,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:16:20,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:16:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:16:21,011 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-10 07:16:21,364 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 07:16:21,520 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 07:16:21,693 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 07:16:21,852 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:16:22,046 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-09-10 07:16:22,324 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2019-09-10 07:16:22,714 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 66 [2019-09-10 07:16:23,137 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-10 07:16:23,394 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-09-10 07:16:28,851 WARN L188 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-09-10 07:16:29,046 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-09-10 07:16:29,233 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-10 07:16:30,552 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:16:30,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:16:30,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-09-10 07:16:30,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:16:30,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 07:16:30,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 07:16:30,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2019-09-10 07:16:30,554 INFO L87 Difference]: Start difference. First operand 20542 states and 28039 transitions. Second operand 32 states. [2019-09-10 07:16:32,120 WARN L188 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 261 DAG size of output: 162 [2019-09-10 07:16:33,654 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 240 DAG size of output: 146 [2019-09-10 07:16:33,951 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 07:16:34,161 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 07:16:34,365 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:16:34,572 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 07:16:34,817 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:16:35,131 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2019-09-10 07:16:35,483 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 07:16:35,807 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-10 07:16:36,217 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-10 07:16:36,874 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-09-10 07:16:37,510 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 87 [2019-09-10 07:16:38,377 WARN L188 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 104 [2019-09-10 07:16:39,818 WARN L188 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 118 [2019-09-10 07:16:42,398 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 213 DAG size of output: 133 [2019-09-10 07:16:45,035 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 234 DAG size of output: 149 [2019-09-10 07:16:46,850 WARN L188 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 245 DAG size of output: 159 [2019-09-10 07:16:47,495 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 96 [2019-09-10 07:16:48,392 WARN L188 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 96 [2019-09-10 07:16:48,915 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-09-10 07:16:49,541 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2019-09-10 07:16:50,292 WARN L188 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 89 [2019-09-10 07:16:51,098 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 89 [2019-09-10 07:16:51,769 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 07:16:52,442 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 07:16:53,543 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-09-10 07:17:00,328 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 07:17:01,035 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-10 07:17:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:04,937 INFO L93 Difference]: Finished difference Result 47266 states and 65241 transitions. [2019-09-10 07:17:04,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 07:17:04,937 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2019-09-10 07:17:04,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:04,984 INFO L225 Difference]: With dead ends: 47266 [2019-09-10 07:17:04,984 INFO L226 Difference]: Without dead ends: 47266 [2019-09-10 07:17:04,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=671, Invalid=3111, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 07:17:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47266 states. [2019-09-10 07:17:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47266 to 20549. [2019-09-10 07:17:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20549 states. [2019-09-10 07:17:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20549 states to 20549 states and 28048 transitions. [2019-09-10 07:17:05,256 INFO L78 Accepts]: Start accepts. Automaton has 20549 states and 28048 transitions. Word has length 102 [2019-09-10 07:17:05,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:05,256 INFO L475 AbstractCegarLoop]: Abstraction has 20549 states and 28048 transitions. [2019-09-10 07:17:05,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-10 07:17:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 20549 states and 28048 transitions. [2019-09-10 07:17:05,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:17:05,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:05,273 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:05,273 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:05,273 INFO L82 PathProgramCache]: Analyzing trace with hash 893371482, now seen corresponding path program 1 times [2019-09-10 07:17:05,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:05,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:05,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:05,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:06,152 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:17:06,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:06,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:17:06,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:06,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:17:06,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:17:06,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:17:06,154 INFO L87 Difference]: Start difference. First operand 20549 states and 28048 transitions. Second operand 18 states. [2019-09-10 07:17:06,980 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-10 07:17:07,943 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-09-10 07:17:08,279 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-09-10 07:17:08,445 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:17:08,699 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-10 07:17:09,009 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 07:17:09,167 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:17:09,338 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-10 07:17:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:11,246 INFO L93 Difference]: Finished difference Result 51215 states and 70386 transitions. [2019-09-10 07:17:11,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 07:17:11,247 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 102 [2019-09-10 07:17:11,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:11,302 INFO L225 Difference]: With dead ends: 51215 [2019-09-10 07:17:11,303 INFO L226 Difference]: Without dead ends: 51215 [2019-09-10 07:17:11,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 07:17:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51215 states. [2019-09-10 07:17:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51215 to 20500. [2019-09-10 07:17:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20500 states. [2019-09-10 07:17:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20500 states to 20500 states and 27988 transitions. [2019-09-10 07:17:11,593 INFO L78 Accepts]: Start accepts. Automaton has 20500 states and 27988 transitions. Word has length 102 [2019-09-10 07:17:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:11,593 INFO L475 AbstractCegarLoop]: Abstraction has 20500 states and 27988 transitions. [2019-09-10 07:17:11,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:17:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 20500 states and 27988 transitions. [2019-09-10 07:17:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:17:11,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:11,609 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:11,609 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:11,609 INFO L82 PathProgramCache]: Analyzing trace with hash 571762759, now seen corresponding path program 1 times [2019-09-10 07:17:11,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:11,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:11,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:11,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:11,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:12,219 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:17:12,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:12,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:17:12,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:12,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:17:12,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:17:12,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:17:12,221 INFO L87 Difference]: Start difference. First operand 20500 states and 27988 transitions. Second operand 12 states. [2019-09-10 07:17:13,034 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2019-09-10 07:17:13,262 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 07:17:13,482 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 07:17:13,726 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 07:17:13,952 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-09-10 07:17:14,183 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:17:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:14,693 INFO L93 Difference]: Finished difference Result 32723 states and 45073 transitions. [2019-09-10 07:17:14,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:17:14,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2019-09-10 07:17:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:14,725 INFO L225 Difference]: With dead ends: 32723 [2019-09-10 07:17:14,725 INFO L226 Difference]: Without dead ends: 32723 [2019-09-10 07:17:14,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:17:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32723 states. [2019-09-10 07:17:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32723 to 20460. [2019-09-10 07:17:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20460 states. [2019-09-10 07:17:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20460 states to 20460 states and 27939 transitions. [2019-09-10 07:17:14,934 INFO L78 Accepts]: Start accepts. Automaton has 20460 states and 27939 transitions. Word has length 102 [2019-09-10 07:17:14,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:14,934 INFO L475 AbstractCegarLoop]: Abstraction has 20460 states and 27939 transitions. [2019-09-10 07:17:14,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:17:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 20460 states and 27939 transitions. [2019-09-10 07:17:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:17:14,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:14,949 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:14,950 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:14,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:14,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1722626528, now seen corresponding path program 1 times [2019-09-10 07:17:14,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:14,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:14,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:15,034 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:17:15,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:15,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:15,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:15,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:15,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:15,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:15,036 INFO L87 Difference]: Start difference. First operand 20460 states and 27939 transitions. Second operand 3 states. [2019-09-10 07:17:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:15,185 INFO L93 Difference]: Finished difference Result 36608 states and 50161 transitions. [2019-09-10 07:17:15,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:15,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 07:17:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:15,222 INFO L225 Difference]: With dead ends: 36608 [2019-09-10 07:17:15,222 INFO L226 Difference]: Without dead ends: 36608 [2019-09-10 07:17:15,222 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:17:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36608 states. [2019-09-10 07:17:15,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36608 to 36606. [2019-09-10 07:17:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36606 states. [2019-09-10 07:17:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36606 states to 36606 states and 50160 transitions. [2019-09-10 07:17:15,531 INFO L78 Accepts]: Start accepts. Automaton has 36606 states and 50160 transitions. Word has length 104 [2019-09-10 07:17:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:15,531 INFO L475 AbstractCegarLoop]: Abstraction has 36606 states and 50160 transitions. [2019-09-10 07:17:15,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 36606 states and 50160 transitions. [2019-09-10 07:17:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:17:15,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:15,552 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:15,552 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:15,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:15,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1201435186, now seen corresponding path program 1 times [2019-09-10 07:17:15,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:15,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:15,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:15,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:15,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:15,850 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:17:15,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:15,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:17:15,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:15,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:17:15,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:17:15,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:15,851 INFO L87 Difference]: Start difference. First operand 36606 states and 50160 transitions. Second operand 7 states. [2019-09-10 07:17:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:16,546 INFO L93 Difference]: Finished difference Result 61486 states and 83805 transitions. [2019-09-10 07:17:16,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:17:16,547 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2019-09-10 07:17:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:16,649 INFO L225 Difference]: With dead ends: 61486 [2019-09-10 07:17:16,650 INFO L226 Difference]: Without dead ends: 61413 [2019-09-10 07:17:16,650 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:17:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61413 states. [2019-09-10 07:17:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61413 to 42040. [2019-09-10 07:17:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42040 states. [2019-09-10 07:17:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42040 states to 42040 states and 57619 transitions. [2019-09-10 07:17:17,263 INFO L78 Accepts]: Start accepts. Automaton has 42040 states and 57619 transitions. Word has length 105 [2019-09-10 07:17:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:17,263 INFO L475 AbstractCegarLoop]: Abstraction has 42040 states and 57619 transitions. [2019-09-10 07:17:17,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:17:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 42040 states and 57619 transitions. [2019-09-10 07:17:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:17:17,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:17,290 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:17,290 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:17,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:17,291 INFO L82 PathProgramCache]: Analyzing trace with hash -29543193, now seen corresponding path program 1 times [2019-09-10 07:17:17,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:17,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:17,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:17,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:17,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:17,396 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:17:17,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:17,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:17:17,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:17,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:17:17,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:17:17,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:17:17,398 INFO L87 Difference]: Start difference. First operand 42040 states and 57619 transitions. Second operand 6 states. [2019-09-10 07:17:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:17,730 INFO L93 Difference]: Finished difference Result 98140 states and 134018 transitions. [2019-09-10 07:17:17,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:17:17,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-09-10 07:17:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:17,872 INFO L225 Difference]: With dead ends: 98140 [2019-09-10 07:17:17,873 INFO L226 Difference]: Without dead ends: 98140 [2019-09-10 07:17:17,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:17:17,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98140 states. [2019-09-10 07:17:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98140 to 43030. [2019-09-10 07:17:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43030 states. [2019-09-10 07:17:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43030 states to 43030 states and 58609 transitions. [2019-09-10 07:17:18,635 INFO L78 Accepts]: Start accepts. Automaton has 43030 states and 58609 transitions. Word has length 106 [2019-09-10 07:17:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:18,635 INFO L475 AbstractCegarLoop]: Abstraction has 43030 states and 58609 transitions. [2019-09-10 07:17:18,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:17:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 43030 states and 58609 transitions. [2019-09-10 07:17:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 07:17:18,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:18,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:18,664 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:18,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash -528945799, now seen corresponding path program 1 times [2019-09-10 07:17:18,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:18,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:18,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:18,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:18,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:18,725 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:17:18,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:18,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:18,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:18,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:18,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:18,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:18,727 INFO L87 Difference]: Start difference. First operand 43030 states and 58609 transitions. Second operand 3 states. [2019-09-10 07:17:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:18,962 INFO L93 Difference]: Finished difference Result 73630 states and 99356 transitions. [2019-09-10 07:17:18,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:18,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 07:17:18,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:19,052 INFO L225 Difference]: With dead ends: 73630 [2019-09-10 07:17:19,053 INFO L226 Difference]: Without dead ends: 73630 [2019-09-10 07:17:19,053 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:17:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73630 states. [2019-09-10 07:17:19,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73630 to 72968. [2019-09-10 07:17:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72968 states. [2019-09-10 07:17:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72968 states to 72968 states and 98695 transitions. [2019-09-10 07:17:19,808 INFO L78 Accepts]: Start accepts. Automaton has 72968 states and 98695 transitions. Word has length 107 [2019-09-10 07:17:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:19,808 INFO L475 AbstractCegarLoop]: Abstraction has 72968 states and 98695 transitions. [2019-09-10 07:17:19,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 72968 states and 98695 transitions. [2019-09-10 07:17:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:17:19,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:19,854 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:19,855 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:19,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:19,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1385491290, now seen corresponding path program 1 times [2019-09-10 07:17:19,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:19,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:19,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:19,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:19,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:19,932 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:17:19,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:19,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:17:19,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:19,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:17:19,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:17:19,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:17:19,934 INFO L87 Difference]: Start difference. First operand 72968 states and 98695 transitions. Second operand 5 states. [2019-09-10 07:17:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:21,028 INFO L93 Difference]: Finished difference Result 191036 states and 256929 transitions. [2019-09-10 07:17:21,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:17:21,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-09-10 07:17:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:21,271 INFO L225 Difference]: With dead ends: 191036 [2019-09-10 07:17:21,272 INFO L226 Difference]: Without dead ends: 191036 [2019-09-10 07:17:21,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:17:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191036 states. [2019-09-10 07:17:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191036 to 95621. [2019-09-10 07:17:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95621 states. [2019-09-10 07:17:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95621 states to 95621 states and 128998 transitions. [2019-09-10 07:17:24,602 INFO L78 Accepts]: Start accepts. Automaton has 95621 states and 128998 transitions. Word has length 108 [2019-09-10 07:17:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:24,603 INFO L475 AbstractCegarLoop]: Abstraction has 95621 states and 128998 transitions. [2019-09-10 07:17:24,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:17:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 95621 states and 128998 transitions. [2019-09-10 07:17:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:17:24,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:24,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:24,651 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:24,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:24,652 INFO L82 PathProgramCache]: Analyzing trace with hash 983679449, now seen corresponding path program 1 times [2019-09-10 07:17:24,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:24,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:24,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:24,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:24,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:24,774 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:17:24,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:24,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:17:24,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:24,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:17:24,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:17:24,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:24,776 INFO L87 Difference]: Start difference. First operand 95621 states and 128998 transitions. Second operand 7 states. [2019-09-10 07:17:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:26,619 INFO L93 Difference]: Finished difference Result 341474 states and 460298 transitions. [2019-09-10 07:17:26,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:17:26,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2019-09-10 07:17:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:27,123 INFO L225 Difference]: With dead ends: 341474 [2019-09-10 07:17:27,123 INFO L226 Difference]: Without dead ends: 341474 [2019-09-10 07:17:27,123 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:17:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341474 states. [2019-09-10 07:17:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341474 to 124757. [2019-09-10 07:17:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124757 states. [2019-09-10 07:17:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124757 states to 124757 states and 168574 transitions. [2019-09-10 07:17:32,917 INFO L78 Accepts]: Start accepts. Automaton has 124757 states and 168574 transitions. Word has length 108 [2019-09-10 07:17:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:32,917 INFO L475 AbstractCegarLoop]: Abstraction has 124757 states and 168574 transitions. [2019-09-10 07:17:32,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:17:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 124757 states and 168574 transitions. [2019-09-10 07:17:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 07:17:32,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:32,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:32,963 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:32,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:32,963 INFO L82 PathProgramCache]: Analyzing trace with hash 100248874, now seen corresponding path program 1 times [2019-09-10 07:17:32,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:32,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:32,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:32,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:32,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:33,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:33,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:17:33,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:33,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:17:33,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:17:33,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:33,064 INFO L87 Difference]: Start difference. First operand 124757 states and 168574 transitions. Second operand 7 states. [2019-09-10 07:17:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:34,958 INFO L93 Difference]: Finished difference Result 406959 states and 548127 transitions. [2019-09-10 07:17:34,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:17:34,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2019-09-10 07:17:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:35,604 INFO L225 Difference]: With dead ends: 406959 [2019-09-10 07:17:35,604 INFO L226 Difference]: Without dead ends: 406959 [2019-09-10 07:17:35,605 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:17:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406959 states. [2019-09-10 07:17:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406959 to 161259. [2019-09-10 07:17:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161259 states. [2019-09-10 07:17:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161259 states to 161259 states and 218156 transitions. [2019-09-10 07:17:42,431 INFO L78 Accepts]: Start accepts. Automaton has 161259 states and 218156 transitions. Word has length 108 [2019-09-10 07:17:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:42,431 INFO L475 AbstractCegarLoop]: Abstraction has 161259 states and 218156 transitions. [2019-09-10 07:17:42,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:17:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 161259 states and 218156 transitions. [2019-09-10 07:17:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 07:17:42,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:42,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:42,487 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:42,487 INFO L82 PathProgramCache]: Analyzing trace with hash -992902577, now seen corresponding path program 1 times [2019-09-10 07:17:42,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:42,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:42,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:42,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:42,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:42,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:42,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:42,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:42,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:42,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:42,584 INFO L87 Difference]: Start difference. First operand 161259 states and 218156 transitions. Second operand 3 states. [2019-09-10 07:17:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:43,345 INFO L93 Difference]: Finished difference Result 238004 states and 318398 transitions. [2019-09-10 07:17:43,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:43,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 07:17:43,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:43,680 INFO L225 Difference]: With dead ends: 238004 [2019-09-10 07:17:43,680 INFO L226 Difference]: Without dead ends: 238004 [2019-09-10 07:17:43,681 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:17:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238004 states. [2019-09-10 07:17:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238004 to 203928. [2019-09-10 07:17:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203928 states. [2019-09-10 07:17:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203928 states to 203928 states and 273625 transitions. [2019-09-10 07:17:46,823 INFO L78 Accepts]: Start accepts. Automaton has 203928 states and 273625 transitions. Word has length 109 [2019-09-10 07:17:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:46,823 INFO L475 AbstractCegarLoop]: Abstraction has 203928 states and 273625 transitions. [2019-09-10 07:17:46,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 203928 states and 273625 transitions. [2019-09-10 07:17:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 07:17:46,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:46,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:46,864 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:46,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1732675720, now seen corresponding path program 1 times [2019-09-10 07:17:46,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:46,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:46,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:46,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:46,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:46,935 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:17:46,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:46,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:46,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:46,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:46,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:46,936 INFO L87 Difference]: Start difference. First operand 203928 states and 273625 transitions. Second operand 3 states. [2019-09-10 07:17:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:47,660 INFO L93 Difference]: Finished difference Result 333666 states and 442582 transitions. [2019-09-10 07:17:47,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:47,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 07:17:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:48,097 INFO L225 Difference]: With dead ends: 333666 [2019-09-10 07:17:48,097 INFO L226 Difference]: Without dead ends: 333666 [2019-09-10 07:17:48,097 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:17:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333666 states. [2019-09-10 07:17:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333666 to 279228. [2019-09-10 07:17:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279228 states. [2019-09-10 07:17:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279228 states to 279228 states and 372415 transitions. [2019-09-10 07:17:56,536 INFO L78 Accepts]: Start accepts. Automaton has 279228 states and 372415 transitions. Word has length 110 [2019-09-10 07:17:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:56,536 INFO L475 AbstractCegarLoop]: Abstraction has 279228 states and 372415 transitions. [2019-09-10 07:17:56,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 279228 states and 372415 transitions. [2019-09-10 07:17:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 07:17:56,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:56,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:17:56,566 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:56,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:56,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1668526696, now seen corresponding path program 1 times [2019-09-10 07:17:56,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:56,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:56,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:56,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:56,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:56,648 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:17:56,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:56,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:56,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:56,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:56,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:56,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:56,655 INFO L87 Difference]: Start difference. First operand 279228 states and 372415 transitions. Second operand 3 states. [2019-09-10 07:17:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:58,005 INFO L93 Difference]: Finished difference Result 367280 states and 484056 transitions. [2019-09-10 07:17:58,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:58,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 07:17:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:58,606 INFO L225 Difference]: With dead ends: 367280 [2019-09-10 07:17:58,606 INFO L226 Difference]: Without dead ends: 367280 [2019-09-10 07:17:58,607 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:17:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367280 states. [2019-09-10 07:18:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367280 to 359556. [2019-09-10 07:18:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359556 states. [2019-09-10 07:18:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359556 states to 359556 states and 475523 transitions. [2019-09-10 07:18:05,764 INFO L78 Accepts]: Start accepts. Automaton has 359556 states and 475523 transitions. Word has length 111 [2019-09-10 07:18:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:05,764 INFO L475 AbstractCegarLoop]: Abstraction has 359556 states and 475523 transitions. [2019-09-10 07:18:05,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:18:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 359556 states and 475523 transitions. [2019-09-10 07:18:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 07:18:05,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:05,780 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:18:05,780 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:05,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:05,781 INFO L82 PathProgramCache]: Analyzing trace with hash -37557945, now seen corresponding path program 1 times [2019-09-10 07:18:05,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:05,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:05,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:05,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:05,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:05,883 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:18:05,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:05,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:18:05,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:05,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:18:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:18:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:18:05,885 INFO L87 Difference]: Start difference. First operand 359556 states and 475523 transitions. Second operand 7 states. [2019-09-10 07:18:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:15,616 INFO L93 Difference]: Finished difference Result 1061487 states and 1393752 transitions. [2019-09-10 07:18:15,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:18:15,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-09-10 07:18:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:17,316 INFO L225 Difference]: With dead ends: 1061487 [2019-09-10 07:18:17,316 INFO L226 Difference]: Without dead ends: 1061487 [2019-09-10 07:18:17,316 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:18:18,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061487 states. [2019-09-10 07:18:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061487 to 466764. [2019-09-10 07:18:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466764 states. [2019-09-10 07:18:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466764 states to 466764 states and 618395 transitions. [2019-09-10 07:18:36,587 INFO L78 Accepts]: Start accepts. Automaton has 466764 states and 618395 transitions. Word has length 112 [2019-09-10 07:18:36,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:36,587 INFO L475 AbstractCegarLoop]: Abstraction has 466764 states and 618395 transitions. [2019-09-10 07:18:36,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:18:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 466764 states and 618395 transitions. [2019-09-10 07:18:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 07:18:36,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:36,683 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:36,683 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:36,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1481099663, now seen corresponding path program 1 times [2019-09-10 07:18:36,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:36,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:36,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:36,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:36,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:36,770 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:18:36,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:36,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:18:36,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:36,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:18:36,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:18:36,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:18:36,772 INFO L87 Difference]: Start difference. First operand 466764 states and 618395 transitions. Second operand 3 states. [2019-09-10 07:18:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:44,835 INFO L93 Difference]: Finished difference Result 698590 states and 911260 transitions. [2019-09-10 07:18:44,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:18:44,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-10 07:18:44,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:46,044 INFO L225 Difference]: With dead ends: 698590 [2019-09-10 07:18:46,044 INFO L226 Difference]: Without dead ends: 698590 [2019-09-10 07:18:46,044 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:18:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698590 states. [2019-09-10 07:18:58,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698590 to 651132. [2019-09-10 07:18:58,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651132 states. [2019-09-10 07:18:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651132 states to 651132 states and 853439 transitions. [2019-09-10 07:18:59,545 INFO L78 Accepts]: Start accepts. Automaton has 651132 states and 853439 transitions. Word has length 137 [2019-09-10 07:18:59,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:59,546 INFO L475 AbstractCegarLoop]: Abstraction has 651132 states and 853439 transitions. [2019-09-10 07:18:59,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:18:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 651132 states and 853439 transitions. [2019-09-10 07:19:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 07:19:06,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:06,948 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:06,949 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:06,949 INFO L82 PathProgramCache]: Analyzing trace with hash -467022193, now seen corresponding path program 1 times [2019-09-10 07:19:06,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:06,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:06,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:06,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:06,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:07,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:07,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:07,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:07,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:07,044 INFO L87 Difference]: Start difference. First operand 651132 states and 853439 transitions. Second operand 3 states. [2019-09-10 07:19:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:10,863 INFO L93 Difference]: Finished difference Result 1237130 states and 1600804 transitions. [2019-09-10 07:19:10,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:10,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-10 07:19:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:21,704 INFO L225 Difference]: With dead ends: 1237130 [2019-09-10 07:19:21,704 INFO L226 Difference]: Without dead ends: 1221955 [2019-09-10 07:19:21,705 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:19:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221955 states. [2019-09-10 07:19:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221955 to 1128828. [2019-09-10 07:19:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128828 states. [2019-09-10 07:19:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128828 states to 1128828 states and 1466309 transitions. [2019-09-10 07:19:50,985 INFO L78 Accepts]: Start accepts. Automaton has 1128828 states and 1466309 transitions. Word has length 140 [2019-09-10 07:19:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:50,985 INFO L475 AbstractCegarLoop]: Abstraction has 1128828 states and 1466309 transitions. [2019-09-10 07:19:50,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1128828 states and 1466309 transitions. [2019-09-10 07:19:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 07:19:51,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:51,074 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:51,074 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:51,075 INFO L82 PathProgramCache]: Analyzing trace with hash -608921226, now seen corresponding path program 1 times [2019-09-10 07:19:51,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:51,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:51,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:51,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:51,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 07:19:51,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:51,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:19:51,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:51,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:19:51,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:19:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:19:51,250 INFO L87 Difference]: Start difference. First operand 1128828 states and 1466309 transitions. Second operand 9 states. [2019-09-10 07:20:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:25,996 INFO L93 Difference]: Finished difference Result 2804721 states and 3626990 transitions. [2019-09-10 07:20:25,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 07:20:25,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2019-09-10 07:20:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:32,232 INFO L225 Difference]: With dead ends: 2804721 [2019-09-10 07:20:32,232 INFO L226 Difference]: Without dead ends: 2804721 [2019-09-10 07:20:32,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-10 07:20:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804721 states. [2019-09-10 07:21:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804721 to 1128452. [2019-09-10 07:21:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128452 states. [2019-09-10 07:21:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128452 states to 1128452 states and 1465853 transitions. [2019-09-10 07:21:30,007 INFO L78 Accepts]: Start accepts. Automaton has 1128452 states and 1465853 transitions. Word has length 141 [2019-09-10 07:21:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:30,007 INFO L475 AbstractCegarLoop]: Abstraction has 1128452 states and 1465853 transitions. [2019-09-10 07:21:30,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:21:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1128452 states and 1465853 transitions. [2019-09-10 07:21:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 07:21:30,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:30,086 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:30,087 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:30,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash 270855748, now seen corresponding path program 1 times [2019-09-10 07:21:30,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:30,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:30,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:30,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:30,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 07:21:30,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:30,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:21:30,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:30,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:21:30,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:21:30,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:21:30,266 INFO L87 Difference]: Start difference. First operand 1128452 states and 1465853 transitions. Second operand 9 states. [2019-09-10 07:22:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:06,944 INFO L93 Difference]: Finished difference Result 4263733 states and 5517259 transitions. [2019-09-10 07:22:06,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:22:06,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2019-09-10 07:22:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:30,981 INFO L225 Difference]: With dead ends: 4263733 [2019-09-10 07:22:30,981 INFO L226 Difference]: Without dead ends: 4263733 [2019-09-10 07:22:30,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:22:33,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263733 states.