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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:52:59,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:52:59,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:52:59,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:52:59,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:52:59,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:52:59,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:52:59,592 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:52:59,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:52:59,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:52:59,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:52:59,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:52:59,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:52:59,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:52:59,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:52:59,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:52:59,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:52:59,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:52:59,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:52:59,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:52:59,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:52:59,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:52:59,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:52:59,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:52:59,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:52:59,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:52:59,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:52:59,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:52:59,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:52:59,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:52:59,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:52:59,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:52:59,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:52:59,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:52:59,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:52:59,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:52:59,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:52:59,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:52:59,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:52:59,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:52:59,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:52:59,644 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:52:59,664 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:52:59,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:52:59,665 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:52:59,665 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:52:59,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:52:59,666 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:52:59,666 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:52:59,666 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:52:59,667 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:52:59,667 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:52:59,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:52:59,669 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:52:59,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:52:59,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:52:59,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:52:59,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:52:59,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:52:59,671 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:52:59,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:52:59,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:52:59,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:52:59,672 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:52:59,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:52:59,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:52:59,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:52:59,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:52:59,673 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:52:59,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:52:59,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:52:59,673 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:52:59,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:52:59,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:52:59,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:52:59,727 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:52:59,727 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:52:59,728 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.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:52:59,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ee054d1/06751b7c13ab42a1871baa02697be73f/FLAG1d202bf30 [2019-09-10 06:53:00,537 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:53:00,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:53:00,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ee054d1/06751b7c13ab42a1871baa02697be73f/FLAG1d202bf30 [2019-09-10 06:53:00,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ee054d1/06751b7c13ab42a1871baa02697be73f [2019-09-10 06:53:00,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:53:00,636 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:53:00,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:53:00,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:53:00,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:53:00,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:53:00" (1/1) ... [2019-09-10 06:53:00,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afe9dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:00, skipping insertion in model container [2019-09-10 06:53:00,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:53:00" (1/1) ... [2019-09-10 06:53:00,653 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:53:00,807 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:53:02,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:53:02,080 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:53:02,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:53:02,638 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:53:02,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:02 WrapperNode [2019-09-10 06:53:02,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:53:02,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:53:02,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:53:02,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:53:02,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:02" (1/1) ... [2019-09-10 06:53:02,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:02" (1/1) ... [2019-09-10 06:53:02,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:02" (1/1) ... [2019-09-10 06:53:02,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:02" (1/1) ... [2019-09-10 06:53:02,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:02" (1/1) ... [2019-09-10 06:53:02,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:02" (1/1) ... [2019-09-10 06:53:02,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:02" (1/1) ... [2019-09-10 06:53:02,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:53:02,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:53:02,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:53:02,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:53:02,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:53:02,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:53:02,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:53:02,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:53:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:53:02,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:53:02,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:53:02,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:53:02,998 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:53:02,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:53:02,999 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:53:02,999 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:53:03,000 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:53:03,000 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:53:03,001 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:53:03,001 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:53:03,002 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:53:03,002 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:53:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:53:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:53:03,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:53:06,493 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:53:06,493 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:53:06,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:53:06 BoogieIcfgContainer [2019-09-10 06:53:06,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:53:06,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:53:06,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:53:06,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:53:06,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:53:00" (1/3) ... [2019-09-10 06:53:06,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f21b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:53:06, skipping insertion in model container [2019-09-10 06:53:06,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:53:02" (2/3) ... [2019-09-10 06:53:06,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f21b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:53:06, skipping insertion in model container [2019-09-10 06:53:06,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:53:06" (3/3) ... [2019-09-10 06:53:06,503 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:53:06,513 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:53:06,523 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-10 06:53:06,542 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-10 06:53:06,569 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:53:06,570 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:53:06,570 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:53:06,570 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:53:06,570 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:53:06,570 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:53:06,570 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:53:06,570 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:53:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states. [2019-09-10 06:53:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:53:06,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:06,637 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] [2019-09-10 06:53:06,639 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:06,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash -492967282, now seen corresponding path program 1 times [2019-09-10 06:53:06,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:06,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:06,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:06,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:06,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:07,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:07,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:53:07,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:07,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:53:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:53:07,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:53:07,519 INFO L87 Difference]: Start difference. First operand 1107 states. Second operand 5 states. [2019-09-10 06:53:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:08,631 INFO L93 Difference]: Finished difference Result 1004 states and 1799 transitions. [2019-09-10 06:53:08,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:53:08,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-10 06:53:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:08,658 INFO L225 Difference]: With dead ends: 1004 [2019-09-10 06:53:08,658 INFO L226 Difference]: Without dead ends: 992 [2019-09-10 06:53:08,660 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 06:53:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-09-10 06:53:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 984. [2019-09-10 06:53:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-09-10 06:53:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1315 transitions. [2019-09-10 06:53:08,804 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1315 transitions. Word has length 67 [2019-09-10 06:53:08,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:08,805 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1315 transitions. [2019-09-10 06:53:08,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:53:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1315 transitions. [2019-09-10 06:53:08,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:53:08,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:08,809 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:53:08,810 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:08,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash 39988205, now seen corresponding path program 1 times [2019-09-10 06:53:08,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:08,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:08,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:08,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:08,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:09,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:09,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:53:09,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:09,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:53:09,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:53:09,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:53:09,135 INFO L87 Difference]: Start difference. First operand 984 states and 1315 transitions. Second operand 6 states. [2019-09-10 06:53:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:09,892 INFO L93 Difference]: Finished difference Result 1335 states and 1878 transitions. [2019-09-10 06:53:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:53:09,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-10 06:53:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:09,900 INFO L225 Difference]: With dead ends: 1335 [2019-09-10 06:53:09,900 INFO L226 Difference]: Without dead ends: 1335 [2019-09-10 06:53:09,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:53:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-09-10 06:53:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1319. [2019-09-10 06:53:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2019-09-10 06:53:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1870 transitions. [2019-09-10 06:53:09,940 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1870 transitions. Word has length 68 [2019-09-10 06:53:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:09,940 INFO L475 AbstractCegarLoop]: Abstraction has 1319 states and 1870 transitions. [2019-09-10 06:53:09,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:53:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1870 transitions. [2019-09-10 06:53:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:53:09,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:09,945 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] [2019-09-10 06:53:09,945 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:09,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:09,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2058401878, now seen corresponding path program 1 times [2019-09-10 06:53:09,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:09,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:09,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:09,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:10,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:10,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:53:10,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:10,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:53:10,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:53:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:53:10,084 INFO L87 Difference]: Start difference. First operand 1319 states and 1870 transitions. Second operand 3 states. [2019-09-10 06:53:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:10,143 INFO L93 Difference]: Finished difference Result 1894 states and 2677 transitions. [2019-09-10 06:53:10,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:53:10,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:53:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:10,156 INFO L225 Difference]: With dead ends: 1894 [2019-09-10 06:53:10,156 INFO L226 Difference]: Without dead ends: 1894 [2019-09-10 06:53:10,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:53:10,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-09-10 06:53:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1882. [2019-09-10 06:53:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2019-09-10 06:53:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2669 transitions. [2019-09-10 06:53:10,205 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2669 transitions. Word has length 69 [2019-09-10 06:53:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:10,206 INFO L475 AbstractCegarLoop]: Abstraction has 1882 states and 2669 transitions. [2019-09-10 06:53:10,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:53:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2669 transitions. [2019-09-10 06:53:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:53:10,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:10,210 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] [2019-09-10 06:53:10,210 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:10,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:10,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1291573, now seen corresponding path program 1 times [2019-09-10 06:53:10,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:10,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:10,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:10,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:10,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:10,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:53:10,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:10,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:53:10,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:53:10,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:53:10,346 INFO L87 Difference]: Start difference. First operand 1882 states and 2669 transitions. Second operand 3 states. [2019-09-10 06:53:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:10,416 INFO L93 Difference]: Finished difference Result 2831 states and 4052 transitions. [2019-09-10 06:53:10,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:53:10,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:53:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:10,435 INFO L225 Difference]: With dead ends: 2831 [2019-09-10 06:53:10,435 INFO L226 Difference]: Without dead ends: 2831 [2019-09-10 06:53:10,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:53:10,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2019-09-10 06:53:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2823. [2019-09-10 06:53:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-09-10 06:53:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 4048 transitions. [2019-09-10 06:53:10,504 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 4048 transitions. Word has length 69 [2019-09-10 06:53:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:10,505 INFO L475 AbstractCegarLoop]: Abstraction has 2823 states and 4048 transitions. [2019-09-10 06:53:10,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:53:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 4048 transitions. [2019-09-10 06:53:10,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:53:10,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:10,510 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] [2019-09-10 06:53:10,510 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:10,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:10,511 INFO L82 PathProgramCache]: Analyzing trace with hash -327434068, now seen corresponding path program 1 times [2019-09-10 06:53:10,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:10,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:10,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:10,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:10,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:10,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:10,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:53:10,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:10,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:53:10,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:53:10,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:53:10,711 INFO L87 Difference]: Start difference. First operand 2823 states and 4048 transitions. Second operand 3 states. [2019-09-10 06:53:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:10,776 INFO L93 Difference]: Finished difference Result 4824 states and 6911 transitions. [2019-09-10 06:53:10,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:53:10,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:53:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:10,799 INFO L225 Difference]: With dead ends: 4824 [2019-09-10 06:53:10,799 INFO L226 Difference]: Without dead ends: 4824 [2019-09-10 06:53:10,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:53:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2019-09-10 06:53:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4806. [2019-09-10 06:53:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4806 states. [2019-09-10 06:53:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4806 states to 4806 states and 6897 transitions. [2019-09-10 06:53:10,918 INFO L78 Accepts]: Start accepts. Automaton has 4806 states and 6897 transitions. Word has length 69 [2019-09-10 06:53:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:10,918 INFO L475 AbstractCegarLoop]: Abstraction has 4806 states and 6897 transitions. [2019-09-10 06:53:10,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:53:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4806 states and 6897 transitions. [2019-09-10 06:53:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:53:10,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:10,927 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] [2019-09-10 06:53:10,928 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:10,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:10,929 INFO L82 PathProgramCache]: Analyzing trace with hash -135245892, now seen corresponding path program 1 times [2019-09-10 06:53:10,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:10,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:10,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:10,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:10,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:11,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:11,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:53:11,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:11,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:53:11,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:53:11,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:53:11,199 INFO L87 Difference]: Start difference. First operand 4806 states and 6897 transitions. Second operand 6 states. [2019-09-10 06:53:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:11,966 INFO L93 Difference]: Finished difference Result 8974 states and 13087 transitions. [2019-09-10 06:53:11,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:53:11,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 06:53:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:12,019 INFO L225 Difference]: With dead ends: 8974 [2019-09-10 06:53:12,019 INFO L226 Difference]: Without dead ends: 8974 [2019-09-10 06:53:12,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:53:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8974 states. [2019-09-10 06:53:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8974 to 8918. [2019-09-10 06:53:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8918 states. [2019-09-10 06:53:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 13039 transitions. [2019-09-10 06:53:12,361 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 13039 transitions. Word has length 69 [2019-09-10 06:53:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:12,361 INFO L475 AbstractCegarLoop]: Abstraction has 8918 states and 13039 transitions. [2019-09-10 06:53:12,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:53:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 13039 transitions. [2019-09-10 06:53:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:53:12,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:12,368 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] [2019-09-10 06:53:12,368 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:12,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:12,369 INFO L82 PathProgramCache]: Analyzing trace with hash 956177235, now seen corresponding path program 1 times [2019-09-10 06:53:12,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:12,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:12,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:12,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:12,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:12,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:12,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:53:12,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:12,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:53:12,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:53:12,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:53:12,523 INFO L87 Difference]: Start difference. First operand 8918 states and 13039 transitions. Second operand 6 states. [2019-09-10 06:53:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:13,097 INFO L93 Difference]: Finished difference Result 21416 states and 31199 transitions. [2019-09-10 06:53:13,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:53:13,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-10 06:53:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:13,172 INFO L225 Difference]: With dead ends: 21416 [2019-09-10 06:53:13,172 INFO L226 Difference]: Without dead ends: 21416 [2019-09-10 06:53:13,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:53:13,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21416 states. [2019-09-10 06:53:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21416 to 21400. [2019-09-10 06:53:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21400 states. [2019-09-10 06:53:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21400 states to 21400 states and 31191 transitions. [2019-09-10 06:53:13,531 INFO L78 Accepts]: Start accepts. Automaton has 21400 states and 31191 transitions. Word has length 70 [2019-09-10 06:53:13,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:13,531 INFO L475 AbstractCegarLoop]: Abstraction has 21400 states and 31191 transitions. [2019-09-10 06:53:13,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:53:13,532 INFO L276 IsEmpty]: Start isEmpty. Operand 21400 states and 31191 transitions. [2019-09-10 06:53:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:53:13,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:13,540 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] [2019-09-10 06:53:13,540 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:13,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1074377200, now seen corresponding path program 1 times [2019-09-10 06:53:13,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:13,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:13,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:13,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:13,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:13,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 06:53:13,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:13,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:53:13,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:13,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:53:13,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:53:13,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:53:13,827 INFO L87 Difference]: Start difference. First operand 21400 states and 31191 transitions. Second operand 3 states. [2019-09-10 06:53:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:13,985 INFO L93 Difference]: Finished difference Result 32303 states and 46525 transitions. [2019-09-10 06:53:13,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:53:13,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 06:53:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:14,059 INFO L225 Difference]: With dead ends: 32303 [2019-09-10 06:53:14,059 INFO L226 Difference]: Without dead ends: 32303 [2019-09-10 06:53:14,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:53:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32303 states. [2019-09-10 06:53:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32303 to 32095. [2019-09-10 06:53:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32095 states. [2019-09-10 06:53:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32095 states to 32095 states and 46321 transitions. [2019-09-10 06:53:15,707 INFO L78 Accepts]: Start accepts. Automaton has 32095 states and 46321 transitions. Word has length 70 [2019-09-10 06:53:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:15,707 INFO L475 AbstractCegarLoop]: Abstraction has 32095 states and 46321 transitions. [2019-09-10 06:53:15,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:53:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 32095 states and 46321 transitions. [2019-09-10 06:53:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:53:15,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:15,717 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] [2019-09-10 06:53:15,717 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:15,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:15,718 INFO L82 PathProgramCache]: Analyzing trace with hash -36131484, now seen corresponding path program 1 times [2019-09-10 06:53:15,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:15,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:15,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:15,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:15,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:53:15,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:15,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:53:15,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:53:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:53:15,870 INFO L87 Difference]: Start difference. First operand 32095 states and 46321 transitions. Second operand 7 states. [2019-09-10 06:53:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:17,310 INFO L93 Difference]: Finished difference Result 103732 states and 150498 transitions. [2019-09-10 06:53:17,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:53:17,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 06:53:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:17,589 INFO L225 Difference]: With dead ends: 103732 [2019-09-10 06:53:17,590 INFO L226 Difference]: Without dead ends: 103732 [2019-09-10 06:53:17,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:53:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103732 states. [2019-09-10 06:53:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103732 to 32123. [2019-09-10 06:53:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32123 states. [2019-09-10 06:53:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32123 states to 32123 states and 46357 transitions. [2019-09-10 06:53:19,180 INFO L78 Accepts]: Start accepts. Automaton has 32123 states and 46357 transitions. Word has length 71 [2019-09-10 06:53:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:19,180 INFO L475 AbstractCegarLoop]: Abstraction has 32123 states and 46357 transitions. [2019-09-10 06:53:19,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:53:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 32123 states and 46357 transitions. [2019-09-10 06:53:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:53:19,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:19,195 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] [2019-09-10 06:53:19,195 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:19,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1924835021, now seen corresponding path program 1 times [2019-09-10 06:53:19,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:19,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:19,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:19,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:19,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:19,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:19,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:53:19,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:19,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:53:19,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:53:19,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:53:19,427 INFO L87 Difference]: Start difference. First operand 32123 states and 46357 transitions. Second operand 7 states. [2019-09-10 06:53:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:21,145 INFO L93 Difference]: Finished difference Result 119082 states and 172701 transitions. [2019-09-10 06:53:21,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:53:21,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 06:53:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:21,375 INFO L225 Difference]: With dead ends: 119082 [2019-09-10 06:53:21,375 INFO L226 Difference]: Without dead ends: 119082 [2019-09-10 06:53:21,376 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 06:53:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119082 states. [2019-09-10 06:53:22,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119082 to 32211. [2019-09-10 06:53:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32211 states. [2019-09-10 06:53:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32211 states to 32211 states and 46478 transitions. [2019-09-10 06:53:22,792 INFO L78 Accepts]: Start accepts. Automaton has 32211 states and 46478 transitions. Word has length 71 [2019-09-10 06:53:22,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:22,792 INFO L475 AbstractCegarLoop]: Abstraction has 32211 states and 46478 transitions. [2019-09-10 06:53:22,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:53:22,792 INFO L276 IsEmpty]: Start isEmpty. Operand 32211 states and 46478 transitions. [2019-09-10 06:53:22,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:53:22,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:22,806 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] [2019-09-10 06:53:22,806 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:22,807 INFO L82 PathProgramCache]: Analyzing trace with hash -181098417, now seen corresponding path program 1 times [2019-09-10 06:53:22,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:22,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:22,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:22,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:22,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:22,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:22,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:53:22,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:22,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:53:22,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:53:22,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:53:22,953 INFO L87 Difference]: Start difference. First operand 32211 states and 46478 transitions. Second operand 7 states. [2019-09-10 06:53:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:24,427 INFO L93 Difference]: Finished difference Result 174378 states and 253489 transitions. [2019-09-10 06:53:24,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:53:24,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 06:53:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:24,634 INFO L225 Difference]: With dead ends: 174378 [2019-09-10 06:53:24,635 INFO L226 Difference]: Without dead ends: 174378 [2019-09-10 06:53:24,635 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 06:53:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174378 states. [2019-09-10 06:53:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174378 to 32279. [2019-09-10 06:53:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32279 states. [2019-09-10 06:53:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32279 states to 32279 states and 46566 transitions. [2019-09-10 06:53:27,163 INFO L78 Accepts]: Start accepts. Automaton has 32279 states and 46566 transitions. Word has length 71 [2019-09-10 06:53:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:27,164 INFO L475 AbstractCegarLoop]: Abstraction has 32279 states and 46566 transitions. [2019-09-10 06:53:27,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:53:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 32279 states and 46566 transitions. [2019-09-10 06:53:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:53:27,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:27,174 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] [2019-09-10 06:53:27,175 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:27,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:27,175 INFO L82 PathProgramCache]: Analyzing trace with hash 514388176, now seen corresponding path program 1 times [2019-09-10 06:53:27,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:27,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:27,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:27,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:27,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:27,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:27,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:53:27,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:27,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:53:27,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:53:27,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:53:27,305 INFO L87 Difference]: Start difference. First operand 32279 states and 46566 transitions. Second operand 7 states. [2019-09-10 06:53:28,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:28,910 INFO L93 Difference]: Finished difference Result 139046 states and 201787 transitions. [2019-09-10 06:53:28,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:53:28,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 06:53:28,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:29,486 INFO L225 Difference]: With dead ends: 139046 [2019-09-10 06:53:29,486 INFO L226 Difference]: Without dead ends: 139046 [2019-09-10 06:53:29,487 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 06:53:29,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139046 states. [2019-09-10 06:53:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139046 to 32442. [2019-09-10 06:53:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32442 states. [2019-09-10 06:53:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32442 states to 32442 states and 46781 transitions. [2019-09-10 06:53:30,187 INFO L78 Accepts]: Start accepts. Automaton has 32442 states and 46781 transitions. Word has length 71 [2019-09-10 06:53:30,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:30,187 INFO L475 AbstractCegarLoop]: Abstraction has 32442 states and 46781 transitions. [2019-09-10 06:53:30,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:53:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 32442 states and 46781 transitions. [2019-09-10 06:53:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:53:30,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:30,197 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] [2019-09-10 06:53:30,197 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:30,197 INFO L82 PathProgramCache]: Analyzing trace with hash 178314812, now seen corresponding path program 1 times [2019-09-10 06:53:30,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:30,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:30,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:30,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:30,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:30,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:30,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:53:30,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:30,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:53:30,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:53:30,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:53:30,393 INFO L87 Difference]: Start difference. First operand 32442 states and 46781 transitions. Second operand 9 states. [2019-09-10 06:53:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:32,791 INFO L93 Difference]: Finished difference Result 136165 states and 200282 transitions. [2019-09-10 06:53:32,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:53:32,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 06:53:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:33,025 INFO L225 Difference]: With dead ends: 136165 [2019-09-10 06:53:33,026 INFO L226 Difference]: Without dead ends: 136165 [2019-09-10 06:53:33,027 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 06:53:33,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136165 states. [2019-09-10 06:53:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136165 to 32430. [2019-09-10 06:53:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32430 states. [2019-09-10 06:53:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32430 states to 32430 states and 46757 transitions. [2019-09-10 06:53:34,109 INFO L78 Accepts]: Start accepts. Automaton has 32430 states and 46757 transitions. Word has length 72 [2019-09-10 06:53:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:34,109 INFO L475 AbstractCegarLoop]: Abstraction has 32430 states and 46757 transitions. [2019-09-10 06:53:34,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:53:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 32430 states and 46757 transitions. [2019-09-10 06:53:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:53:34,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:34,119 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] [2019-09-10 06:53:34,119 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:34,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:34,120 INFO L82 PathProgramCache]: Analyzing trace with hash 334798970, now seen corresponding path program 1 times [2019-09-10 06:53:34,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:34,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:34,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:34,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:34,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:35,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:35,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:53:35,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:35,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:53:35,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:53:35,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:53:35,013 INFO L87 Difference]: Start difference. First operand 32430 states and 46757 transitions. Second operand 7 states. [2019-09-10 06:53:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:36,510 INFO L93 Difference]: Finished difference Result 119367 states and 173072 transitions. [2019-09-10 06:53:36,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:53:36,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-09-10 06:53:36,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:36,653 INFO L225 Difference]: With dead ends: 119367 [2019-09-10 06:53:36,653 INFO L226 Difference]: Without dead ends: 119367 [2019-09-10 06:53:36,653 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 06:53:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119367 states. [2019-09-10 06:53:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119367 to 32521. [2019-09-10 06:53:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32521 states. [2019-09-10 06:53:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32521 states to 32521 states and 46885 transitions. [2019-09-10 06:53:37,486 INFO L78 Accepts]: Start accepts. Automaton has 32521 states and 46885 transitions. Word has length 72 [2019-09-10 06:53:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:37,486 INFO L475 AbstractCegarLoop]: Abstraction has 32521 states and 46885 transitions. [2019-09-10 06:53:37,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:53:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 32521 states and 46885 transitions. [2019-09-10 06:53:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:53:37,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:37,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] [2019-09-10 06:53:37,495 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:37,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash -132358958, now seen corresponding path program 1 times [2019-09-10 06:53:37,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:37,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:37,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:37,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:37,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:37,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:37,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:53:37,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:37,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:53:37,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:53:37,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:53:37,731 INFO L87 Difference]: Start difference. First operand 32521 states and 46885 transitions. Second operand 9 states. [2019-09-10 06:53:40,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:40,152 INFO L93 Difference]: Finished difference Result 136269 states and 200436 transitions. [2019-09-10 06:53:40,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:53:40,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 06:53:40,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:40,310 INFO L225 Difference]: With dead ends: 136269 [2019-09-10 06:53:40,310 INFO L226 Difference]: Without dead ends: 136269 [2019-09-10 06:53:40,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:53:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136269 states. [2019-09-10 06:53:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136269 to 32493. [2019-09-10 06:53:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32493 states. [2019-09-10 06:53:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32493 states to 32493 states and 46841 transitions. [2019-09-10 06:53:41,172 INFO L78 Accepts]: Start accepts. Automaton has 32493 states and 46841 transitions. Word has length 72 [2019-09-10 06:53:41,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:41,172 INFO L475 AbstractCegarLoop]: Abstraction has 32493 states and 46841 transitions. [2019-09-10 06:53:41,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:53:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 32493 states and 46841 transitions. [2019-09-10 06:53:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:53:41,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:41,179 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] [2019-09-10 06:53:41,180 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:41,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:41,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1003542542, now seen corresponding path program 1 times [2019-09-10 06:53:41,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:41,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:41,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:41,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:41,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:41,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:41,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:53:41,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:41,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:53:41,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:53:41,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:53:41,539 INFO L87 Difference]: Start difference. First operand 32493 states and 46841 transitions. Second operand 9 states. [2019-09-10 06:53:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:43,773 INFO L93 Difference]: Finished difference Result 129920 states and 189431 transitions. [2019-09-10 06:53:43,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 06:53:43,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-10 06:53:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:43,916 INFO L225 Difference]: With dead ends: 129920 [2019-09-10 06:53:43,916 INFO L226 Difference]: Without dead ends: 129920 [2019-09-10 06:53:43,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 06:53:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129920 states. [2019-09-10 06:53:44,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129920 to 32307. [2019-09-10 06:53:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32307 states. [2019-09-10 06:53:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32307 states to 32307 states and 46594 transitions. [2019-09-10 06:53:44,786 INFO L78 Accepts]: Start accepts. Automaton has 32307 states and 46594 transitions. Word has length 72 [2019-09-10 06:53:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:44,786 INFO L475 AbstractCegarLoop]: Abstraction has 32307 states and 46594 transitions. [2019-09-10 06:53:44,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:53:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 32307 states and 46594 transitions. [2019-09-10 06:53:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:53:44,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:44,794 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] [2019-09-10 06:53:44,794 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:44,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 499783753, now seen corresponding path program 1 times [2019-09-10 06:53:44,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:44,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:44,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:44,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:44,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:44,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:44,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:53:44,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:44,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:53:44,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:53:44,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:53:44,946 INFO L87 Difference]: Start difference. First operand 32307 states and 46594 transitions. Second operand 8 states. [2019-09-10 06:53:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:46,890 INFO L93 Difference]: Finished difference Result 107015 states and 156876 transitions. [2019-09-10 06:53:46,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:53:46,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-09-10 06:53:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:47,007 INFO L225 Difference]: With dead ends: 107015 [2019-09-10 06:53:47,007 INFO L226 Difference]: Without dead ends: 107015 [2019-09-10 06:53:47,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:53:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107015 states. [2019-09-10 06:53:47,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107015 to 31715. [2019-09-10 06:53:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31715 states. [2019-09-10 06:53:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31715 states to 31715 states and 45822 transitions. [2019-09-10 06:53:47,586 INFO L78 Accepts]: Start accepts. Automaton has 31715 states and 45822 transitions. Word has length 72 [2019-09-10 06:53:47,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:47,586 INFO L475 AbstractCegarLoop]: Abstraction has 31715 states and 45822 transitions. [2019-09-10 06:53:47,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:53:47,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31715 states and 45822 transitions. [2019-09-10 06:53:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:53:47,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:47,594 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] [2019-09-10 06:53:47,595 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:47,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash -108281974, now seen corresponding path program 1 times [2019-09-10 06:53:47,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:47,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:47,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:47,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:48,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:48,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:53:48,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:48,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:53:48,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:53:48,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:53:48,297 INFO L87 Difference]: Start difference. First operand 31715 states and 45822 transitions. Second operand 12 states. [2019-09-10 06:53:51,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:51,152 INFO L93 Difference]: Finished difference Result 181591 states and 266979 transitions. [2019-09-10 06:53:51,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:53:51,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-10 06:53:51,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:51,680 INFO L225 Difference]: With dead ends: 181591 [2019-09-10 06:53:51,680 INFO L226 Difference]: Without dead ends: 181591 [2019-09-10 06:53:51,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:53:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181591 states. [2019-09-10 06:53:52,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181591 to 31638. [2019-09-10 06:53:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31638 states. [2019-09-10 06:53:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31638 states to 31638 states and 45711 transitions. [2019-09-10 06:53:52,503 INFO L78 Accepts]: Start accepts. Automaton has 31638 states and 45711 transitions. Word has length 73 [2019-09-10 06:53:52,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:52,504 INFO L475 AbstractCegarLoop]: Abstraction has 31638 states and 45711 transitions. [2019-09-10 06:53:52,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:53:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 31638 states and 45711 transitions. [2019-09-10 06:53:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:53:52,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:52,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] [2019-09-10 06:53:52,509 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:52,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:52,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1790307750, now seen corresponding path program 1 times [2019-09-10 06:53:52,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:52,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:52,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:52,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:52,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:52,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 06:53:52,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:52,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:53:52,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:52,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:53:52,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:53:52,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:53:52,912 INFO L87 Difference]: Start difference. First operand 31638 states and 45711 transitions. Second operand 11 states. [2019-09-10 06:53:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:55,321 INFO L93 Difference]: Finished difference Result 164821 states and 241667 transitions. [2019-09-10 06:53:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:53:55,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2019-09-10 06:53:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:53:55,521 INFO L225 Difference]: With dead ends: 164821 [2019-09-10 06:53:55,521 INFO L226 Difference]: Without dead ends: 164821 [2019-09-10 06:53:55,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 06:53:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164821 states. [2019-09-10 06:53:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164821 to 31173. [2019-09-10 06:53:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31173 states. [2019-09-10 06:53:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31173 states to 31173 states and 45075 transitions. [2019-09-10 06:53:56,742 INFO L78 Accepts]: Start accepts. Automaton has 31173 states and 45075 transitions. Word has length 73 [2019-09-10 06:53:56,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:53:56,742 INFO L475 AbstractCegarLoop]: Abstraction has 31173 states and 45075 transitions. [2019-09-10 06:53:56,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:53:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 31173 states and 45075 transitions. [2019-09-10 06:53:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:53:56,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:53:56,748 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] [2019-09-10 06:53:56,748 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:53:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:53:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash 127087552, now seen corresponding path program 1 times [2019-09-10 06:53:56,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:53:56,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:56,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:53:56,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:53:56,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:53:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:53:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:53:57,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:53:57,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 06:53:57,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:53:57,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 06:53:57,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 06:53:57,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-10 06:53:57,151 INFO L87 Difference]: Start difference. First operand 31173 states and 45075 transitions. Second operand 12 states. [2019-09-10 06:53:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:53:59,800 INFO L93 Difference]: Finished difference Result 181702 states and 266972 transitions. [2019-09-10 06:53:59,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:53:59,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-10 06:53:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:00,010 INFO L225 Difference]: With dead ends: 181702 [2019-09-10 06:54:00,011 INFO L226 Difference]: Without dead ends: 181702 [2019-09-10 06:54:00,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-10 06:54:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181702 states. [2019-09-10 06:54:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181702 to 30777. [2019-09-10 06:54:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30777 states. [2019-09-10 06:54:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30777 states to 30777 states and 44576 transitions. [2019-09-10 06:54:01,393 INFO L78 Accepts]: Start accepts. Automaton has 30777 states and 44576 transitions. Word has length 73 [2019-09-10 06:54:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:01,393 INFO L475 AbstractCegarLoop]: Abstraction has 30777 states and 44576 transitions. [2019-09-10 06:54:01,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 06:54:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 30777 states and 44576 transitions. [2019-09-10 06:54:01,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:54:01,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:01,400 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] [2019-09-10 06:54:01,400 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:01,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:01,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1318862985, now seen corresponding path program 1 times [2019-09-10 06:54:01,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:01,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:01,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:01,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:01,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:01,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:01,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:01,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:01,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:01,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:01,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:01,479 INFO L87 Difference]: Start difference. First operand 30777 states and 44576 transitions. Second operand 3 states. [2019-09-10 06:54:01,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:01,588 INFO L93 Difference]: Finished difference Result 30781 states and 44062 transitions. [2019-09-10 06:54:01,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:01,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 06:54:01,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:01,635 INFO L225 Difference]: With dead ends: 30781 [2019-09-10 06:54:01,636 INFO L226 Difference]: Without dead ends: 30781 [2019-09-10 06:54:01,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:01,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30781 states. [2019-09-10 06:54:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30781 to 30777. [2019-09-10 06:54:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30777 states. [2019-09-10 06:54:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30777 states to 30777 states and 44060 transitions. [2019-09-10 06:54:02,103 INFO L78 Accepts]: Start accepts. Automaton has 30777 states and 44060 transitions. Word has length 74 [2019-09-10 06:54:02,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:02,103 INFO L475 AbstractCegarLoop]: Abstraction has 30777 states and 44060 transitions. [2019-09-10 06:54:02,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 30777 states and 44060 transitions. [2019-09-10 06:54:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:54:02,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:02,114 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] [2019-09-10 06:54:02,114 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:02,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2059949975, now seen corresponding path program 1 times [2019-09-10 06:54:02,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:02,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:02,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:02,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:02,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:02,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:02,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:02,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:02,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:02,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:02,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:02,226 INFO L87 Difference]: Start difference. First operand 30777 states and 44060 transitions. Second operand 3 states. [2019-09-10 06:54:02,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:02,492 INFO L93 Difference]: Finished difference Result 45854 states and 66138 transitions. [2019-09-10 06:54:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:02,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 06:54:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:02,559 INFO L225 Difference]: With dead ends: 45854 [2019-09-10 06:54:02,559 INFO L226 Difference]: Without dead ends: 45854 [2019-09-10 06:54:02,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45854 states. [2019-09-10 06:54:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45854 to 35882. [2019-09-10 06:54:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35882 states. [2019-09-10 06:54:03,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35882 states to 35882 states and 51667 transitions. [2019-09-10 06:54:03,009 INFO L78 Accepts]: Start accepts. Automaton has 35882 states and 51667 transitions. Word has length 75 [2019-09-10 06:54:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:03,010 INFO L475 AbstractCegarLoop]: Abstraction has 35882 states and 51667 transitions. [2019-09-10 06:54:03,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 35882 states and 51667 transitions. [2019-09-10 06:54:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:54:03,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:03,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:03,016 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash 927142990, now seen corresponding path program 1 times [2019-09-10 06:54:03,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:03,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:03,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:03,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:03,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:03,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:03,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:03,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:03,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:03,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:03,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:03,090 INFO L87 Difference]: Start difference. First operand 35882 states and 51667 transitions. Second operand 3 states. [2019-09-10 06:54:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:03,236 INFO L93 Difference]: Finished difference Result 38879 states and 55984 transitions. [2019-09-10 06:54:03,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:03,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 06:54:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:03,286 INFO L225 Difference]: With dead ends: 38879 [2019-09-10 06:54:03,286 INFO L226 Difference]: Without dead ends: 38879 [2019-09-10 06:54:03,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:03,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38879 states. [2019-09-10 06:54:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38879 to 34652. [2019-09-10 06:54:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34652 states. [2019-09-10 06:54:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34652 states to 34652 states and 50008 transitions. [2019-09-10 06:54:03,632 INFO L78 Accepts]: Start accepts. Automaton has 34652 states and 50008 transitions. Word has length 75 [2019-09-10 06:54:03,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:03,632 INFO L475 AbstractCegarLoop]: Abstraction has 34652 states and 50008 transitions. [2019-09-10 06:54:03,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34652 states and 50008 transitions. [2019-09-10 06:54:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:54:03,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:03,637 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] [2019-09-10 06:54:03,637 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:03,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:03,638 INFO L82 PathProgramCache]: Analyzing trace with hash 444387185, now seen corresponding path program 1 times [2019-09-10 06:54:03,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:03,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:03,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:03,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:03,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:03,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:03,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:03,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:54:03,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:03,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:54:03,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:54:03,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:54:03,811 INFO L87 Difference]: Start difference. First operand 34652 states and 50008 transitions. Second operand 9 states. [2019-09-10 06:54:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:05,590 INFO L93 Difference]: Finished difference Result 120155 states and 175048 transitions. [2019-09-10 06:54:05,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 06:54:05,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-09-10 06:54:05,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:05,732 INFO L225 Difference]: With dead ends: 120155 [2019-09-10 06:54:05,732 INFO L226 Difference]: Without dead ends: 120155 [2019-09-10 06:54:05,733 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 06:54:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120155 states. [2019-09-10 06:54:06,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120155 to 34580. [2019-09-10 06:54:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34580 states. [2019-09-10 06:54:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34580 states to 34580 states and 49910 transitions. [2019-09-10 06:54:06,644 INFO L78 Accepts]: Start accepts. Automaton has 34580 states and 49910 transitions. Word has length 76 [2019-09-10 06:54:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:06,644 INFO L475 AbstractCegarLoop]: Abstraction has 34580 states and 49910 transitions. [2019-09-10 06:54:06,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:54:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 34580 states and 49910 transitions. [2019-09-10 06:54:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 06:54:06,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:06,650 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] [2019-09-10 06:54:06,651 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:06,651 INFO L82 PathProgramCache]: Analyzing trace with hash -31713190, now seen corresponding path program 1 times [2019-09-10 06:54:06,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:06,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:06,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:06,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:06,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:06,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:06,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:06,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:06,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:06,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:06,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:06,739 INFO L87 Difference]: Start difference. First operand 34580 states and 49910 transitions. Second operand 3 states. [2019-09-10 06:54:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:06,881 INFO L93 Difference]: Finished difference Result 34584 states and 49389 transitions. [2019-09-10 06:54:06,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:06,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 06:54:06,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:06,932 INFO L225 Difference]: With dead ends: 34584 [2019-09-10 06:54:06,933 INFO L226 Difference]: Without dead ends: 34584 [2019-09-10 06:54:06,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:06,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34584 states. [2019-09-10 06:54:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34584 to 34580. [2019-09-10 06:54:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34580 states. [2019-09-10 06:54:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34580 states to 34580 states and 49387 transitions. [2019-09-10 06:54:07,364 INFO L78 Accepts]: Start accepts. Automaton has 34580 states and 49387 transitions. Word has length 77 [2019-09-10 06:54:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:07,365 INFO L475 AbstractCegarLoop]: Abstraction has 34580 states and 49387 transitions. [2019-09-10 06:54:07,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 34580 states and 49387 transitions. [2019-09-10 06:54:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:54:07,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:07,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:07,376 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:07,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:07,377 INFO L82 PathProgramCache]: Analyzing trace with hash 598552081, now seen corresponding path program 1 times [2019-09-10 06:54:07,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:07,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:07,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:07,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:07,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:08,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:08,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:54:08,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:08,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:54:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:54:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:54:08,257 INFO L87 Difference]: Start difference. First operand 34580 states and 49387 transitions. Second operand 17 states. [2019-09-10 06:54:08,885 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 06:54:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:10,751 INFO L93 Difference]: Finished difference Result 55817 states and 80048 transitions. [2019-09-10 06:54:10,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 06:54:10,752 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2019-09-10 06:54:10,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:10,817 INFO L225 Difference]: With dead ends: 55817 [2019-09-10 06:54:10,817 INFO L226 Difference]: Without dead ends: 55817 [2019-09-10 06:54:10,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:54:10,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55817 states. [2019-09-10 06:54:11,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55817 to 34516. [2019-09-10 06:54:11,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34516 states. [2019-09-10 06:54:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34516 states to 34516 states and 49307 transitions. [2019-09-10 06:54:11,216 INFO L78 Accepts]: Start accepts. Automaton has 34516 states and 49307 transitions. Word has length 79 [2019-09-10 06:54:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:11,216 INFO L475 AbstractCegarLoop]: Abstraction has 34516 states and 49307 transitions. [2019-09-10 06:54:11,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:54:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 34516 states and 49307 transitions. [2019-09-10 06:54:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 06:54:11,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:11,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] [2019-09-10 06:54:11,223 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:11,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1291163895, now seen corresponding path program 1 times [2019-09-10 06:54:11,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:11,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:11,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:11,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:11,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:11,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:11,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:11,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:11,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:11,310 INFO L87 Difference]: Start difference. First operand 34516 states and 49307 transitions. Second operand 3 states. [2019-09-10 06:54:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:11,543 INFO L93 Difference]: Finished difference Result 52819 states and 75738 transitions. [2019-09-10 06:54:11,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:11,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 06:54:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:11,618 INFO L225 Difference]: With dead ends: 52819 [2019-09-10 06:54:11,618 INFO L226 Difference]: Without dead ends: 52819 [2019-09-10 06:54:11,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52819 states. [2019-09-10 06:54:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52819 to 34379. [2019-09-10 06:54:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34379 states. [2019-09-10 06:54:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34379 states to 34379 states and 49019 transitions. [2019-09-10 06:54:12,128 INFO L78 Accepts]: Start accepts. Automaton has 34379 states and 49019 transitions. Word has length 79 [2019-09-10 06:54:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:12,129 INFO L475 AbstractCegarLoop]: Abstraction has 34379 states and 49019 transitions. [2019-09-10 06:54:12,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 34379 states and 49019 transitions. [2019-09-10 06:54:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 06:54:12,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:12,140 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 06:54:12,141 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:12,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:12,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1359737498, now seen corresponding path program 1 times [2019-09-10 06:54:12,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:12,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:12,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:12,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:12,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:12,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:12,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 06:54:12,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:12,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 06:54:12,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 06:54:12,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:54:12,529 INFO L87 Difference]: Start difference. First operand 34379 states and 49019 transitions. Second operand 11 states. [2019-09-10 06:54:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:13,730 INFO L93 Difference]: Finished difference Result 95209 states and 137057 transitions. [2019-09-10 06:54:13,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 06:54:13,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2019-09-10 06:54:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:13,828 INFO L225 Difference]: With dead ends: 95209 [2019-09-10 06:54:13,828 INFO L226 Difference]: Without dead ends: 95209 [2019-09-10 06:54:13,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:54:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95209 states. [2019-09-10 06:54:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95209 to 34373. [2019-09-10 06:54:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34373 states. [2019-09-10 06:54:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34373 states to 34373 states and 49010 transitions. [2019-09-10 06:54:14,344 INFO L78 Accepts]: Start accepts. Automaton has 34373 states and 49010 transitions. Word has length 80 [2019-09-10 06:54:14,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:14,344 INFO L475 AbstractCegarLoop]: Abstraction has 34373 states and 49010 transitions. [2019-09-10 06:54:14,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 06:54:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 34373 states and 49010 transitions. [2019-09-10 06:54:14,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 06:54:14,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:14,360 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:14,361 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:14,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:14,361 INFO L82 PathProgramCache]: Analyzing trace with hash 638116678, now seen corresponding path program 1 times [2019-09-10 06:54:14,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:14,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:14,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:14,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:14,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:14,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:14,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:54:14,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:14,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:54:14,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:54:14,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:54:14,484 INFO L87 Difference]: Start difference. First operand 34373 states and 49010 transitions. Second operand 7 states. [2019-09-10 06:54:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:15,188 INFO L93 Difference]: Finished difference Result 248039 states and 351926 transitions. [2019-09-10 06:54:15,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:54:15,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-10 06:54:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:15,502 INFO L225 Difference]: With dead ends: 248039 [2019-09-10 06:54:15,502 INFO L226 Difference]: Without dead ends: 248039 [2019-09-10 06:54:15,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:54:15,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248039 states. [2019-09-10 06:54:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248039 to 129503. [2019-09-10 06:54:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129503 states. [2019-09-10 06:54:17,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129503 states to 129503 states and 183940 transitions. [2019-09-10 06:54:17,579 INFO L78 Accepts]: Start accepts. Automaton has 129503 states and 183940 transitions. Word has length 88 [2019-09-10 06:54:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:17,579 INFO L475 AbstractCegarLoop]: Abstraction has 129503 states and 183940 transitions. [2019-09-10 06:54:17,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:54:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 129503 states and 183940 transitions. [2019-09-10 06:54:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 06:54:17,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:17,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, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:17,601 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1941368129, now seen corresponding path program 1 times [2019-09-10 06:54:17,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:17,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:17,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:17,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:17,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:54:17,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:17,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:54:17,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:54:17,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:17,767 INFO L87 Difference]: Start difference. First operand 129503 states and 183940 transitions. Second operand 6 states. [2019-09-10 06:54:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:18,451 INFO L93 Difference]: Finished difference Result 135607 states and 190649 transitions. [2019-09-10 06:54:18,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:54:18,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-10 06:54:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:18,785 INFO L225 Difference]: With dead ends: 135607 [2019-09-10 06:54:18,786 INFO L226 Difference]: Without dead ends: 135389 [2019-09-10 06:54:18,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135389 states. [2019-09-10 06:54:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135389 to 117546. [2019-09-10 06:54:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117546 states. [2019-09-10 06:54:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117546 states to 117546 states and 165764 transitions. [2019-09-10 06:54:23,776 INFO L78 Accepts]: Start accepts. Automaton has 117546 states and 165764 transitions. Word has length 89 [2019-09-10 06:54:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:23,776 INFO L475 AbstractCegarLoop]: Abstraction has 117546 states and 165764 transitions. [2019-09-10 06:54:23,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:54:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 117546 states and 165764 transitions. [2019-09-10 06:54:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 06:54:23,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:23,801 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:54:23,801 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:23,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:23,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1942450074, now seen corresponding path program 1 times [2019-09-10 06:54:23,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:23,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:23,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:23,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:23,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:54:23,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:23,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:54:23,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:54:23,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:54:23,916 INFO L87 Difference]: Start difference. First operand 117546 states and 165764 transitions. Second operand 6 states. [2019-09-10 06:54:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:24,478 INFO L93 Difference]: Finished difference Result 219229 states and 304422 transitions. [2019-09-10 06:54:24,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:54:24,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-10 06:54:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:24,909 INFO L225 Difference]: With dead ends: 219229 [2019-09-10 06:54:24,909 INFO L226 Difference]: Without dead ends: 219229 [2019-09-10 06:54:24,910 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 06:54:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219229 states. [2019-09-10 06:54:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219229 to 120000. [2019-09-10 06:54:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120000 states. [2019-09-10 06:54:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120000 states to 120000 states and 167400 transitions. [2019-09-10 06:54:26,552 INFO L78 Accepts]: Start accepts. Automaton has 120000 states and 167400 transitions. Word has length 90 [2019-09-10 06:54:26,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:26,552 INFO L475 AbstractCegarLoop]: Abstraction has 120000 states and 167400 transitions. [2019-09-10 06:54:26,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:54:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 120000 states and 167400 transitions. [2019-09-10 06:54:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 06:54:26,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:26,580 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 06:54:26,581 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash 473303259, now seen corresponding path program 1 times [2019-09-10 06:54:26,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:26,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:26,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:26,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:26,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:26,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:26,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:26,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:26,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:26,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:26,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:26,665 INFO L87 Difference]: Start difference. First operand 120000 states and 167400 transitions. Second operand 3 states. [2019-09-10 06:54:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:27,463 INFO L93 Difference]: Finished difference Result 222472 states and 306779 transitions. [2019-09-10 06:54:27,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:27,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 06:54:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:28,878 INFO L225 Difference]: With dead ends: 222472 [2019-09-10 06:54:28,878 INFO L226 Difference]: Without dead ends: 222472 [2019-09-10 06:54:28,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:29,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222472 states. [2019-09-10 06:54:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222472 to 220266. [2019-09-10 06:54:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220266 states. [2019-09-10 06:54:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220266 states to 220266 states and 304574 transitions. [2019-09-10 06:54:31,013 INFO L78 Accepts]: Start accepts. Automaton has 220266 states and 304574 transitions. Word has length 91 [2019-09-10 06:54:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:31,014 INFO L475 AbstractCegarLoop]: Abstraction has 220266 states and 304574 transitions. [2019-09-10 06:54:31,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 220266 states and 304574 transitions. [2019-09-10 06:54:31,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 06:54:31,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:31,058 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 06:54:31,058 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:31,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:31,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1096080938, now seen corresponding path program 1 times [2019-09-10 06:54:31,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:31,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:31,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:31,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:31,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:31,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:31,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:31,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:31,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:31,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:31,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:31,144 INFO L87 Difference]: Start difference. First operand 220266 states and 304574 transitions. Second operand 3 states. [2019-09-10 06:54:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:33,091 INFO L93 Difference]: Finished difference Result 418001 states and 569862 transitions. [2019-09-10 06:54:33,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:33,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 06:54:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:33,668 INFO L225 Difference]: With dead ends: 418001 [2019-09-10 06:54:33,668 INFO L226 Difference]: Without dead ends: 413998 [2019-09-10 06:54:33,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413998 states. [2019-09-10 06:54:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413998 to 389363. [2019-09-10 06:54:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389363 states. [2019-09-10 06:54:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389363 states to 389363 states and 532658 transitions. [2019-09-10 06:54:42,284 INFO L78 Accepts]: Start accepts. Automaton has 389363 states and 532658 transitions. Word has length 92 [2019-09-10 06:54:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:54:42,284 INFO L475 AbstractCegarLoop]: Abstraction has 389363 states and 532658 transitions. [2019-09-10 06:54:42,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:54:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 389363 states and 532658 transitions. [2019-09-10 06:54:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 06:54:42,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:54:42,332 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 06:54:42,332 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:54:42,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:54:42,332 INFO L82 PathProgramCache]: Analyzing trace with hash -489740822, now seen corresponding path program 1 times [2019-09-10 06:54:42,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:54:42,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:42,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:54:42,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:54:42,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:54:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:54:42,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:54:42,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:54:42,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:54:42,418 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:54:42,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:54:42,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:54:42,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:42,419 INFO L87 Difference]: Start difference. First operand 389363 states and 532658 transitions. Second operand 3 states. [2019-09-10 06:54:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:54:48,640 INFO L93 Difference]: Finished difference Result 747028 states and 1005687 transitions. [2019-09-10 06:54:48,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:54:48,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 06:54:48,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:54:49,835 INFO L225 Difference]: With dead ends: 747028 [2019-09-10 06:54:49,835 INFO L226 Difference]: Without dead ends: 747028 [2019-09-10 06:54:49,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:54:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747028 states. [2019-09-10 06:55:05,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747028 to 700521. [2019-09-10 06:55:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700521 states. [2019-09-10 06:55:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700521 states to 700521 states and 943688 transitions. [2019-09-10 06:55:06,752 INFO L78 Accepts]: Start accepts. Automaton has 700521 states and 943688 transitions. Word has length 93 [2019-09-10 06:55:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:06,752 INFO L475 AbstractCegarLoop]: Abstraction has 700521 states and 943688 transitions. [2019-09-10 06:55:06,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 700521 states and 943688 transitions. [2019-09-10 06:55:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 06:55:06,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:06,783 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 06:55:06,784 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:06,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:06,784 INFO L82 PathProgramCache]: Analyzing trace with hash 880497978, now seen corresponding path program 1 times [2019-09-10 06:55:06,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:06,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:06,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:06,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:06,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:06,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:06,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:06,862 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:06,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:06,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:06,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:06,863 INFO L87 Difference]: Start difference. First operand 700521 states and 943688 transitions. Second operand 3 states. [2019-09-10 06:55:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:55:18,036 INFO L93 Difference]: Finished difference Result 1289500 states and 1713115 transitions. [2019-09-10 06:55:18,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:55:18,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 06:55:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:55:19,851 INFO L225 Difference]: With dead ends: 1289500 [2019-09-10 06:55:19,851 INFO L226 Difference]: Without dead ends: 1278949 [2019-09-10 06:55:19,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278949 states. [2019-09-10 06:55:40,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278949 to 1182351. [2019-09-10 06:55:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182351 states. [2019-09-10 06:55:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182351 states to 1182351 states and 1581839 transitions. [2019-09-10 06:55:57,379 INFO L78 Accepts]: Start accepts. Automaton has 1182351 states and 1581839 transitions. Word has length 94 [2019-09-10 06:55:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:55:57,380 INFO L475 AbstractCegarLoop]: Abstraction has 1182351 states and 1581839 transitions. [2019-09-10 06:55:57,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:55:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1182351 states and 1581839 transitions. [2019-09-10 06:55:57,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 06:55:57,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:55:57,401 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 06:55:57,401 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:55:57,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:55:57,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1896018749, now seen corresponding path program 1 times [2019-09-10 06:55:57,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:55:57,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:57,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:55:57,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:55:57,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:55:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:55:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:55:57,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:55:57,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:55:57,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:55:57,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:55:57,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:55:57,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:55:57,478 INFO L87 Difference]: Start difference. First operand 1182351 states and 1581839 transitions. Second operand 3 states. [2019-09-10 06:56:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:56:18,375 INFO L93 Difference]: Finished difference Result 1850397 states and 2438280 transitions. [2019-09-10 06:56:18,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:56:18,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 06:56:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:56:21,322 INFO L225 Difference]: With dead ends: 1850397 [2019-09-10 06:56:21,322 INFO L226 Difference]: Without dead ends: 1850352 [2019-09-10 06:56:21,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:56:32,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850352 states. [2019-09-10 06:57:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850352 to 1694013. [2019-09-10 06:57:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1694013 states.