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_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:41:19,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:41:19,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:41:19,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:41:19,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:41:19,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:41:19,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:41:19,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:41:19,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:41:19,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:41:19,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:41:19,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:41:19,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:41:19,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:41:19,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:41:19,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:41:19,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:41:19,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:41:19,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:41:19,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:41:19,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:41:19,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:41:19,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:41:19,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:41:19,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:41:19,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:41:19,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:41:19,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:41:19,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:41:19,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:41:19,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:41:19,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:41:19,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:41:19,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:41:19,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:41:19,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:41:19,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:41:19,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:41:19,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:41:19,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:41:19,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:41:19,751 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 08:41:19,776 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:41:19,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:41:19,777 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:41:19,777 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:41:19,780 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:41:19,780 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:41:19,780 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:41:19,781 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:41:19,781 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:41:19,781 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:41:19,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:41:19,784 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:41:19,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:41:19,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:41:19,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:41:19,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:41:19,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:41:19,785 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:41:19,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:41:19,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:41:19,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:41:19,786 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:41:19,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:41:19,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:41:19,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:41:19,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:41:19,788 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:41:19,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:41:19,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:41:19,789 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:41:19,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:41:19,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:41:19,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:41:19,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:41:19,870 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:41:19,871 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:41:19,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82a7927c/4bc84881f3de4f5b9c0776587d5cefb7/FLAG765a4532f [2019-09-10 08:41:20,424 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:41:20,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:41:20,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82a7927c/4bc84881f3de4f5b9c0776587d5cefb7/FLAG765a4532f [2019-09-10 08:41:20,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e82a7927c/4bc84881f3de4f5b9c0776587d5cefb7 [2019-09-10 08:41:20,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:41:20,767 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:41:20,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:41:20,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:41:20,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:41:20,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:41:20" (1/1) ... [2019-09-10 08:41:20,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c6fc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:41:20, skipping insertion in model container [2019-09-10 08:41:20,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:41:20" (1/1) ... [2019-09-10 08:41:20,784 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:41:20,844 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:41:21,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:41:21,408 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:41:21,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:41:21,506 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:41:21,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:41:21 WrapperNode [2019-09-10 08:41:21,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:41:21,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:41:21,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:41:21,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:41:21,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:41:21" (1/1) ... [2019-09-10 08:41:21,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:41:21" (1/1) ... [2019-09-10 08:41:21,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:41:21" (1/1) ... [2019-09-10 08:41:21,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:41:21" (1/1) ... [2019-09-10 08:41:21,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:41:21" (1/1) ... [2019-09-10 08:41:21,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:41:21" (1/1) ... [2019-09-10 08:41:21,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:41:21" (1/1) ... [2019-09-10 08:41:21,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:41:21,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:41:21,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:41:21,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:41:21,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:41:21" (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 08:41:21,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:41:21,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:41:21,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:41:21,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:41:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:41:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:41:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:41:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:41:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:41:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:41:21,630 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:41:21,633 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:41:21,633 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:41:21,634 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:41:21,634 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:41:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:41:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:41:21,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:41:22,486 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:41:22,487 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:41:22,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:41:22 BoogieIcfgContainer [2019-09-10 08:41:22,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:41:22,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:41:22,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:41:22,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:41:22,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:41:20" (1/3) ... [2019-09-10 08:41:22,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7970498d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:41:22, skipping insertion in model container [2019-09-10 08:41:22,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:41:21" (2/3) ... [2019-09-10 08:41:22,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7970498d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:41:22, skipping insertion in model container [2019-09-10 08:41:22,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:41:22" (3/3) ... [2019-09-10 08:41:22,497 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-10 08:41:22,507 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:41:22,516 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:41:22,533 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:41:22,561 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:41:22,562 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:41:22,562 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:41:22,562 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:41:22,562 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:41:22,563 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:41:22,563 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:41:22,563 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:41:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-10 08:41:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 08:41:22,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:22,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:22,604 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:22,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:22,611 INFO L82 PathProgramCache]: Analyzing trace with hash -902016562, now seen corresponding path program 1 times [2019-09-10 08:41:22,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:22,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:22,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:22,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:23,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:23,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:23,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:23,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:23,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:23,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:23,181 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-09-10 08:41:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:23,310 INFO L93 Difference]: Finished difference Result 225 states and 373 transitions. [2019-09-10 08:41:23,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:23,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 08:41:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:23,326 INFO L225 Difference]: With dead ends: 225 [2019-09-10 08:41:23,326 INFO L226 Difference]: Without dead ends: 217 [2019-09-10 08:41:23,328 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 08:41:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-10 08:41:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-09-10 08:41:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-10 08:41:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 333 transitions. [2019-09-10 08:41:23,398 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 333 transitions. Word has length 66 [2019-09-10 08:41:23,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:23,399 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 333 transitions. [2019-09-10 08:41:23,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 333 transitions. [2019-09-10 08:41:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:41:23,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:23,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:23,406 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:23,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:23,407 INFO L82 PathProgramCache]: Analyzing trace with hash 730168783, now seen corresponding path program 1 times [2019-09-10 08:41:23,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:23,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:23,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:23,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:23,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:23,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:23,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:23,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:23,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:23,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:23,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:23,577 INFO L87 Difference]: Start difference. First operand 215 states and 333 transitions. Second operand 3 states. [2019-09-10 08:41:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:23,629 INFO L93 Difference]: Finished difference Result 353 states and 557 transitions. [2019-09-10 08:41:23,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:23,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 08:41:23,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:23,633 INFO L225 Difference]: With dead ends: 353 [2019-09-10 08:41:23,633 INFO L226 Difference]: Without dead ends: 353 [2019-09-10 08:41:23,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-09-10 08:41:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2019-09-10 08:41:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-10 08:41:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 556 transitions. [2019-09-10 08:41:23,674 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 556 transitions. Word has length 68 [2019-09-10 08:41:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:23,675 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 556 transitions. [2019-09-10 08:41:23,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 556 transitions. [2019-09-10 08:41:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 08:41:23,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:23,679 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:23,679 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1550224880, now seen corresponding path program 1 times [2019-09-10 08:41:23,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:23,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:23,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:23,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:23,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:23,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:23,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:23,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:23,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:23,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:23,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:23,800 INFO L87 Difference]: Start difference. First operand 351 states and 556 transitions. Second operand 3 states. [2019-09-10 08:41:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:23,829 INFO L93 Difference]: Finished difference Result 609 states and 973 transitions. [2019-09-10 08:41:23,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:23,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 08:41:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:23,839 INFO L225 Difference]: With dead ends: 609 [2019-09-10 08:41:23,839 INFO L226 Difference]: Without dead ends: 609 [2019-09-10 08:41:23,840 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 08:41:23,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-10 08:41:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 607. [2019-09-10 08:41:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-10 08:41:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 972 transitions. [2019-09-10 08:41:23,892 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 972 transitions. Word has length 70 [2019-09-10 08:41:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:23,893 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 972 transitions. [2019-09-10 08:41:23,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 972 transitions. [2019-09-10 08:41:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 08:41:23,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:23,898 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:23,898 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:23,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:23,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2032710127, now seen corresponding path program 1 times [2019-09-10 08:41:23,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:23,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:23,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:23,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:23,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:24,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:24,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:41:24,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:24,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:41:24,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:41:24,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:24,078 INFO L87 Difference]: Start difference. First operand 607 states and 972 transitions. Second operand 5 states. [2019-09-10 08:41:24,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:24,193 INFO L93 Difference]: Finished difference Result 1725 states and 2797 transitions. [2019-09-10 08:41:24,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:41:24,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 08:41:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:24,203 INFO L225 Difference]: With dead ends: 1725 [2019-09-10 08:41:24,203 INFO L226 Difference]: Without dead ends: 1725 [2019-09-10 08:41:24,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2019-09-10 08:41:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1431. [2019-09-10 08:41:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-09-10 08:41:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2318 transitions. [2019-09-10 08:41:24,279 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2318 transitions. Word has length 72 [2019-09-10 08:41:24,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:24,280 INFO L475 AbstractCegarLoop]: Abstraction has 1431 states and 2318 transitions. [2019-09-10 08:41:24,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:41:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2318 transitions. [2019-09-10 08:41:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 08:41:24,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:24,283 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:24,283 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:24,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:24,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1348885045, now seen corresponding path program 1 times [2019-09-10 08:41:24,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:24,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:24,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:24,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:24,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:24,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:24,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:41:24,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:24,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:41:24,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:41:24,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:41:24,389 INFO L87 Difference]: Start difference. First operand 1431 states and 2318 transitions. Second operand 6 states. [2019-09-10 08:41:24,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:24,578 INFO L93 Difference]: Finished difference Result 5193 states and 8374 transitions. [2019-09-10 08:41:24,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:41:24,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-09-10 08:41:24,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:24,604 INFO L225 Difference]: With dead ends: 5193 [2019-09-10 08:41:24,604 INFO L226 Difference]: Without dead ends: 5193 [2019-09-10 08:41:24,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:41:24,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2019-09-10 08:41:24,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 5090. [2019-09-10 08:41:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5090 states. [2019-09-10 08:41:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5090 states to 5090 states and 8227 transitions. [2019-09-10 08:41:24,739 INFO L78 Accepts]: Start accepts. Automaton has 5090 states and 8227 transitions. Word has length 73 [2019-09-10 08:41:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:24,740 INFO L475 AbstractCegarLoop]: Abstraction has 5090 states and 8227 transitions. [2019-09-10 08:41:24,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:41:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 5090 states and 8227 transitions. [2019-09-10 08:41:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:41:24,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:24,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:24,743 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:24,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:24,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1795572021, now seen corresponding path program 1 times [2019-09-10 08:41:24,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:24,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:24,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:24,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:24,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:24,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:24,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:24,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:24,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:24,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:24,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:24,844 INFO L87 Difference]: Start difference. First operand 5090 states and 8227 transitions. Second operand 3 states. [2019-09-10 08:41:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:24,926 INFO L93 Difference]: Finished difference Result 7085 states and 11459 transitions. [2019-09-10 08:41:24,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:24,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 08:41:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:25,040 INFO L225 Difference]: With dead ends: 7085 [2019-09-10 08:41:25,041 INFO L226 Difference]: Without dead ends: 7085 [2019-09-10 08:41:25,041 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 08:41:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2019-09-10 08:41:25,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 7083. [2019-09-10 08:41:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7083 states. [2019-09-10 08:41:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7083 states to 7083 states and 11458 transitions. [2019-09-10 08:41:25,207 INFO L78 Accepts]: Start accepts. Automaton has 7083 states and 11458 transitions. Word has length 74 [2019-09-10 08:41:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:25,209 INFO L475 AbstractCegarLoop]: Abstraction has 7083 states and 11458 transitions. [2019-09-10 08:41:25,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 7083 states and 11458 transitions. [2019-09-10 08:41:25,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:41:25,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:25,218 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:25,218 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:25,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:25,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1561348457, now seen corresponding path program 1 times [2019-09-10 08:41:25,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:25,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:25,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:25,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:25,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:25,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 08:41:25,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:25,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:25,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:25,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:25,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:25,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:25,311 INFO L87 Difference]: Start difference. First operand 7083 states and 11458 transitions. Second operand 3 states. [2019-09-10 08:41:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:25,383 INFO L93 Difference]: Finished difference Result 9748 states and 15682 transitions. [2019-09-10 08:41:25,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:25,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 08:41:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:25,447 INFO L225 Difference]: With dead ends: 9748 [2019-09-10 08:41:25,447 INFO L226 Difference]: Without dead ends: 9748 [2019-09-10 08:41:25,448 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 08:41:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9748 states. [2019-09-10 08:41:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9748 to 9746. [2019-09-10 08:41:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9746 states. [2019-09-10 08:41:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 15681 transitions. [2019-09-10 08:41:25,719 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 15681 transitions. Word has length 74 [2019-09-10 08:41:25,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:25,720 INFO L475 AbstractCegarLoop]: Abstraction has 9746 states and 15681 transitions. [2019-09-10 08:41:25,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 15681 transitions. [2019-09-10 08:41:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:41:25,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:25,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:25,721 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:25,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1191289000, now seen corresponding path program 1 times [2019-09-10 08:41:25,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:25,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:25,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:25,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:25,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:25,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:25,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:41:25,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:25,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:25,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:25,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:25,818 INFO L87 Difference]: Start difference. First operand 9746 states and 15681 transitions. Second operand 4 states. [2019-09-10 08:41:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:25,945 INFO L93 Difference]: Finished difference Result 15236 states and 24455 transitions. [2019-09-10 08:41:25,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:41:25,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-10 08:41:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:25,979 INFO L225 Difference]: With dead ends: 15236 [2019-09-10 08:41:25,980 INFO L226 Difference]: Without dead ends: 15236 [2019-09-10 08:41:25,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:25,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15236 states. [2019-09-10 08:41:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15236 to 15181. [2019-09-10 08:41:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15181 states. [2019-09-10 08:41:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15181 states to 15181 states and 24351 transitions. [2019-09-10 08:41:26,248 INFO L78 Accepts]: Start accepts. Automaton has 15181 states and 24351 transitions. Word has length 74 [2019-09-10 08:41:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:26,249 INFO L475 AbstractCegarLoop]: Abstraction has 15181 states and 24351 transitions. [2019-09-10 08:41:26,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:41:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 15181 states and 24351 transitions. [2019-09-10 08:41:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:41:26,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:26,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:26,251 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:26,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:26,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1031073657, now seen corresponding path program 1 times [2019-09-10 08:41:26,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:26,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:26,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:26,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:26,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:26,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:26,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:26,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:26,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:26,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:26,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:26,751 INFO L87 Difference]: Start difference. First operand 15181 states and 24351 transitions. Second operand 3 states. [2019-09-10 08:41:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:26,835 INFO L93 Difference]: Finished difference Result 20915 states and 33283 transitions. [2019-09-10 08:41:26,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:26,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 08:41:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:26,881 INFO L225 Difference]: With dead ends: 20915 [2019-09-10 08:41:26,881 INFO L226 Difference]: Without dead ends: 20915 [2019-09-10 08:41:26,882 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 08:41:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20915 states. [2019-09-10 08:41:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20915 to 20913. [2019-09-10 08:41:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20913 states. [2019-09-10 08:41:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20913 states to 20913 states and 33282 transitions. [2019-09-10 08:41:27,307 INFO L78 Accepts]: Start accepts. Automaton has 20913 states and 33282 transitions. Word has length 74 [2019-09-10 08:41:27,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:27,307 INFO L475 AbstractCegarLoop]: Abstraction has 20913 states and 33282 transitions. [2019-09-10 08:41:27,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 20913 states and 33282 transitions. [2019-09-10 08:41:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 08:41:27,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:27,308 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:27,308 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:27,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:27,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1672252252, now seen corresponding path program 1 times [2019-09-10 08:41:27,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:27,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:27,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:27,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:27,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:27,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:27,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:41:27,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:27,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:27,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:27,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:27,400 INFO L87 Difference]: Start difference. First operand 20913 states and 33282 transitions. Second operand 4 states. [2019-09-10 08:41:27,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:27,628 INFO L93 Difference]: Finished difference Result 46805 states and 74408 transitions. [2019-09-10 08:41:27,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:41:27,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-10 08:41:27,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:27,740 INFO L225 Difference]: With dead ends: 46805 [2019-09-10 08:41:27,740 INFO L226 Difference]: Without dead ends: 46805 [2019-09-10 08:41:27,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:27,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46805 states. [2019-09-10 08:41:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46805 to 31642. [2019-09-10 08:41:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31642 states. [2019-09-10 08:41:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31642 states to 31642 states and 50126 transitions. [2019-09-10 08:41:28,462 INFO L78 Accepts]: Start accepts. Automaton has 31642 states and 50126 transitions. Word has length 75 [2019-09-10 08:41:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:28,463 INFO L475 AbstractCegarLoop]: Abstraction has 31642 states and 50126 transitions. [2019-09-10 08:41:28,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:41:28,463 INFO L276 IsEmpty]: Start isEmpty. Operand 31642 states and 50126 transitions. [2019-09-10 08:41:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:41:28,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:28,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:28,464 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:28,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:28,465 INFO L82 PathProgramCache]: Analyzing trace with hash -772989972, now seen corresponding path program 1 times [2019-09-10 08:41:28,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:28,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:28,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:28,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:28,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:28,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:28,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:41:28,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:28,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:41:28,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:41:28,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:28,607 INFO L87 Difference]: Start difference. First operand 31642 states and 50126 transitions. Second operand 5 states. [2019-09-10 08:41:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:28,800 INFO L93 Difference]: Finished difference Result 34402 states and 54395 transitions. [2019-09-10 08:41:28,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:41:28,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:41:28,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:28,852 INFO L225 Difference]: With dead ends: 34402 [2019-09-10 08:41:28,852 INFO L226 Difference]: Without dead ends: 34402 [2019-09-10 08:41:28,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:28,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34402 states. [2019-09-10 08:41:29,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34402 to 31642. [2019-09-10 08:41:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31642 states. [2019-09-10 08:41:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31642 states to 31642 states and 49976 transitions. [2019-09-10 08:41:29,987 INFO L78 Accepts]: Start accepts. Automaton has 31642 states and 49976 transitions. Word has length 77 [2019-09-10 08:41:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:29,987 INFO L475 AbstractCegarLoop]: Abstraction has 31642 states and 49976 transitions. [2019-09-10 08:41:29,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:41:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 31642 states and 49976 transitions. [2019-09-10 08:41:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:41:29,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:29,989 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:29,989 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash -579116247, now seen corresponding path program 1 times [2019-09-10 08:41:29,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:29,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:29,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:29,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:29,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:30,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:30,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:41:30,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:30,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:41:30,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:41:30,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:30,169 INFO L87 Difference]: Start difference. First operand 31642 states and 49976 transitions. Second operand 5 states. [2019-09-10 08:41:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:30,430 INFO L93 Difference]: Finished difference Result 72078 states and 113854 transitions. [2019-09-10 08:41:30,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:41:30,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-10 08:41:30,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:30,556 INFO L225 Difference]: With dead ends: 72078 [2019-09-10 08:41:30,557 INFO L226 Difference]: Without dead ends: 72078 [2019-09-10 08:41:30,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72078 states. [2019-09-10 08:41:31,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72078 to 43903. [2019-09-10 08:41:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43903 states. [2019-09-10 08:41:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43903 states to 43903 states and 69159 transitions. [2019-09-10 08:41:31,394 INFO L78 Accepts]: Start accepts. Automaton has 43903 states and 69159 transitions. Word has length 80 [2019-09-10 08:41:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:31,394 INFO L475 AbstractCegarLoop]: Abstraction has 43903 states and 69159 transitions. [2019-09-10 08:41:31,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:41:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 43903 states and 69159 transitions. [2019-09-10 08:41:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:41:31,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:31,395 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:31,395 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:31,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:31,396 INFO L82 PathProgramCache]: Analyzing trace with hash -774643767, now seen corresponding path program 1 times [2019-09-10 08:41:31,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:31,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:31,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:31,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:31,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:31,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:41:31,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:31,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:41:31,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:41:31,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:31,720 INFO L87 Difference]: Start difference. First operand 43903 states and 69159 transitions. Second operand 5 states. [2019-09-10 08:41:31,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:31,965 INFO L93 Difference]: Finished difference Result 76989 states and 120049 transitions. [2019-09-10 08:41:31,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:41:31,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 08:41:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:32,060 INFO L225 Difference]: With dead ends: 76989 [2019-09-10 08:41:32,060 INFO L226 Difference]: Without dead ends: 76989 [2019-09-10 08:41:32,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:41:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76989 states. [2019-09-10 08:41:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76989 to 44931. [2019-09-10 08:41:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44931 states. [2019-09-10 08:41:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44931 states to 44931 states and 70178 transitions. [2019-09-10 08:41:33,867 INFO L78 Accepts]: Start accepts. Automaton has 44931 states and 70178 transitions. Word has length 81 [2019-09-10 08:41:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:33,867 INFO L475 AbstractCegarLoop]: Abstraction has 44931 states and 70178 transitions. [2019-09-10 08:41:33,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:41:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 44931 states and 70178 transitions. [2019-09-10 08:41:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:41:33,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:33,870 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:33,870 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:33,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1389875202, now seen corresponding path program 1 times [2019-09-10 08:41:33,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:33,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:33,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:33,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:41:34,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:34,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:41:34,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:34,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:34,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:34,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:34,056 INFO L87 Difference]: Start difference. First operand 44931 states and 70178 transitions. Second operand 4 states. [2019-09-10 08:41:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:34,378 INFO L93 Difference]: Finished difference Result 88113 states and 137506 transitions. [2019-09-10 08:41:34,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:41:34,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-10 08:41:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:34,519 INFO L225 Difference]: With dead ends: 88113 [2019-09-10 08:41:34,520 INFO L226 Difference]: Without dead ends: 88113 [2019-09-10 08:41:34,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88113 states. [2019-09-10 08:41:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88113 to 81200. [2019-09-10 08:41:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81200 states. [2019-09-10 08:41:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81200 states to 81200 states and 126679 transitions. [2019-09-10 08:41:35,533 INFO L78 Accepts]: Start accepts. Automaton has 81200 states and 126679 transitions. Word has length 105 [2019-09-10 08:41:35,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:35,534 INFO L475 AbstractCegarLoop]: Abstraction has 81200 states and 126679 transitions. [2019-09-10 08:41:35,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:41:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 81200 states and 126679 transitions. [2019-09-10 08:41:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:41:35,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:35,535 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:35,535 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:35,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:35,536 INFO L82 PathProgramCache]: Analyzing trace with hash 451828384, now seen corresponding path program 1 times [2019-09-10 08:41:35,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:35,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:35,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:35,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:35,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:41:35,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:35,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:35,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:35,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:35,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:35,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:35,614 INFO L87 Difference]: Start difference. First operand 81200 states and 126679 transitions. Second operand 3 states. [2019-09-10 08:41:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:35,772 INFO L93 Difference]: Finished difference Result 67781 states and 105254 transitions. [2019-09-10 08:41:35,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:35,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 08:41:35,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:35,849 INFO L225 Difference]: With dead ends: 67781 [2019-09-10 08:41:35,849 INFO L226 Difference]: Without dead ends: 67781 [2019-09-10 08:41:35,849 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 08:41:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67781 states. [2019-09-10 08:41:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67781 to 67662. [2019-09-10 08:41:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67662 states. [2019-09-10 08:41:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67662 states to 67662 states and 105085 transitions. [2019-09-10 08:41:36,827 INFO L78 Accepts]: Start accepts. Automaton has 67662 states and 105085 transitions. Word has length 105 [2019-09-10 08:41:36,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:36,827 INFO L475 AbstractCegarLoop]: Abstraction has 67662 states and 105085 transitions. [2019-09-10 08:41:36,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 67662 states and 105085 transitions. [2019-09-10 08:41:36,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:41:36,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:36,829 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:36,829 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:36,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:36,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2140593730, now seen corresponding path program 1 times [2019-09-10 08:41:36,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:36,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:36,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:36,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:36,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 08:41:36,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:36,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:41:36,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:36,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:41:36,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:41:36,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:41:36,999 INFO L87 Difference]: Start difference. First operand 67662 states and 105085 transitions. Second operand 4 states. [2019-09-10 08:41:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:37,377 INFO L93 Difference]: Finished difference Result 123840 states and 191511 transitions. [2019-09-10 08:41:37,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:41:37,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-10 08:41:37,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:37,523 INFO L225 Difference]: With dead ends: 123840 [2019-09-10 08:41:37,523 INFO L226 Difference]: Without dead ends: 123840 [2019-09-10 08:41:37,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123840 states. [2019-09-10 08:41:38,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123840 to 107403. [2019-09-10 08:41:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107403 states. [2019-09-10 08:41:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107403 states to 107403 states and 166628 transitions. [2019-09-10 08:41:38,880 INFO L78 Accepts]: Start accepts. Automaton has 107403 states and 166628 transitions. Word has length 105 [2019-09-10 08:41:38,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:38,880 INFO L475 AbstractCegarLoop]: Abstraction has 107403 states and 166628 transitions. [2019-09-10 08:41:38,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:41:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand 107403 states and 166628 transitions. [2019-09-10 08:41:38,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:41:38,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:38,881 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:38,881 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:38,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:38,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1024080765, now seen corresponding path program 1 times [2019-09-10 08:41:38,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:38,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:38,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:38,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:38,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:41:38,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:38,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:41:38,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:38,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:41:38,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:41:38,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:38,987 INFO L87 Difference]: Start difference. First operand 107403 states and 166628 transitions. Second operand 5 states. [2019-09-10 08:41:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:39,526 INFO L93 Difference]: Finished difference Result 135512 states and 209986 transitions. [2019-09-10 08:41:39,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:41:39,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 08:41:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:40,224 INFO L225 Difference]: With dead ends: 135512 [2019-09-10 08:41:40,225 INFO L226 Difference]: Without dead ends: 135512 [2019-09-10 08:41:40,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:41:40,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135512 states. [2019-09-10 08:41:43,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135512 to 129560. [2019-09-10 08:41:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129560 states. [2019-09-10 08:41:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129560 states to 129560 states and 200637 transitions. [2019-09-10 08:41:43,941 INFO L78 Accepts]: Start accepts. Automaton has 129560 states and 200637 transitions. Word has length 106 [2019-09-10 08:41:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:43,941 INFO L475 AbstractCegarLoop]: Abstraction has 129560 states and 200637 transitions. [2019-09-10 08:41:43,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:41:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 129560 states and 200637 transitions. [2019-09-10 08:41:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:41:43,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:43,943 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:43,944 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:43,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:43,944 INFO L82 PathProgramCache]: Analyzing trace with hash -522040011, now seen corresponding path program 1 times [2019-09-10 08:41:43,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:43,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:43,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:43,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:43,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:41:44,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:41:44,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:41:44,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:44,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:41:44,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:41:44,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:41:44,016 INFO L87 Difference]: Start difference. First operand 129560 states and 200637 transitions. Second operand 3 states. [2019-09-10 08:41:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:41:44,432 INFO L93 Difference]: Finished difference Result 198944 states and 307510 transitions. [2019-09-10 08:41:44,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:41:44,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 08:41:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:41:44,689 INFO L225 Difference]: With dead ends: 198944 [2019-09-10 08:41:44,689 INFO L226 Difference]: Without dead ends: 198944 [2019-09-10 08:41:44,689 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 08:41:44,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198944 states. [2019-09-10 08:41:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198944 to 198430. [2019-09-10 08:41:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198430 states. [2019-09-10 08:41:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198430 states to 198430 states and 306997 transitions. [2019-09-10 08:41:47,079 INFO L78 Accepts]: Start accepts. Automaton has 198430 states and 306997 transitions. Word has length 108 [2019-09-10 08:41:47,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:41:47,080 INFO L475 AbstractCegarLoop]: Abstraction has 198430 states and 306997 transitions. [2019-09-10 08:41:47,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:41:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand 198430 states and 306997 transitions. [2019-09-10 08:41:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:41:47,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:41:47,082 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:41:47,082 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:41:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:47,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1372872252, now seen corresponding path program 1 times [2019-09-10 08:41:47,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:41:47,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:47,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:41:47,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:41:47,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:41:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:41:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:41:47,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:41:47,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:41:47,196 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 109 with the following transitions: [2019-09-10 08:41:47,198 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [155], [158], [173], [176], [179], [181], [183], [186], [201], [209], [211], [214], [217], [220], [223], [230], [238], [240], [243], [244], [246], [255], [258], [269], [272], [278], [286], [290], [294], [296], [299], [330], [340], [350], [360], [364], [366], [369], [400], [410], [420], [436], [439], [470], [480], [490], [605], [606], [610], [611], [612] [2019-09-10 08:41:47,252 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:41:47,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:41:47,469 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:41:47,779 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 08:41:47,783 INFO L272 AbstractInterpreter]: Visited 93 different actions 329 times. Merged at 41 different actions 214 times. Widened at 15 different actions 23 times. Performed 1118 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1118 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 7 fixpoints after 5 different actions. Largest state had 174 variables. [2019-09-10 08:41:47,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:41:47,788 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 08:41:51,259 INFO L227 lantSequenceWeakener]: Weakened 86 states. On average, predicates are now at 85.38% of their original sizes. [2019-09-10 08:41:51,259 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 08:41:56,340 INFO L420 sIntCurrentIteration]: We unified 107 AI predicates to 107 [2019-09-10 08:41:56,341 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 08:41:56,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:41:56,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [6] total 73 [2019-09-10 08:41:56,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:41:56,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 08:41:56,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 08:41:56,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=4223, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 08:41:56,348 INFO L87 Difference]: Start difference. First operand 198430 states and 306997 transitions. Second operand 69 states. [2019-09-10 08:43:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:25,586 INFO L93 Difference]: Finished difference Result 851194 states and 1299892 transitions. [2019-09-10 08:43:25,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2019-09-10 08:43:25,586 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 108 [2019-09-10 08:43:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:27,180 INFO L225 Difference]: With dead ends: 851194 [2019-09-10 08:43:27,181 INFO L226 Difference]: Without dead ends: 851194 [2019-09-10 08:43:27,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18148 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=6354, Invalid=40086, Unknown=0, NotChecked=0, Total=46440 [2019-09-10 08:43:27,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851194 states. [2019-09-10 08:43:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851194 to 252328. [2019-09-10 08:43:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252328 states. [2019-09-10 08:43:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252328 states to 252328 states and 388445 transitions. [2019-09-10 08:43:41,471 INFO L78 Accepts]: Start accepts. Automaton has 252328 states and 388445 transitions. Word has length 108 [2019-09-10 08:43:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:41,471 INFO L475 AbstractCegarLoop]: Abstraction has 252328 states and 388445 transitions. [2019-09-10 08:43:41,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-10 08:43:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 252328 states and 388445 transitions. [2019-09-10 08:43:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:43:41,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:41,474 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:41,475 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:41,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:41,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1591845379, now seen corresponding path program 1 times [2019-09-10 08:43:41,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:41,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:41,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:41,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:41,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:41,531 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:43:41,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:41,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:41,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:41,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:41,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:41,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:41,533 INFO L87 Difference]: Start difference. First operand 252328 states and 388445 transitions. Second operand 3 states. [2019-09-10 08:43:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:47,113 INFO L93 Difference]: Finished difference Result 504642 states and 776868 transitions. [2019-09-10 08:43:47,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:47,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 08:43:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:47,975 INFO L225 Difference]: With dead ends: 504642 [2019-09-10 08:43:47,976 INFO L226 Difference]: Without dead ends: 504642 [2019-09-10 08:43:47,976 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 08:43:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504642 states. [2019-09-10 08:43:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504642 to 252331. [2019-09-10 08:43:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252331 states. [2019-09-10 08:43:53,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252331 states to 252331 states and 388449 transitions. [2019-09-10 08:43:53,653 INFO L78 Accepts]: Start accepts. Automaton has 252331 states and 388449 transitions. Word has length 109 [2019-09-10 08:43:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:53,653 INFO L475 AbstractCegarLoop]: Abstraction has 252331 states and 388449 transitions. [2019-09-10 08:43:53,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 252331 states and 388449 transitions. [2019-09-10 08:43:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:43:53,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:53,656 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:53,656 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:53,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1612690820, now seen corresponding path program 1 times [2019-09-10 08:43:53,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:53,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:53,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:53,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:43:53,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:53,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:53,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:53,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:53,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:53,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:53,715 INFO L87 Difference]: Start difference. First operand 252331 states and 388449 transitions. Second operand 3 states. [2019-09-10 08:43:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:54,980 INFO L93 Difference]: Finished difference Result 504628 states and 776842 transitions. [2019-09-10 08:43:54,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:54,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 08:43:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:55,797 INFO L225 Difference]: With dead ends: 504628 [2019-09-10 08:43:55,797 INFO L226 Difference]: Without dead ends: 504628 [2019-09-10 08:43:55,798 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 08:44:02,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504628 states. [2019-09-10 08:44:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504628 to 252333. [2019-09-10 08:44:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252333 states. [2019-09-10 08:44:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252333 states to 252333 states and 388451 transitions. [2019-09-10 08:44:06,716 INFO L78 Accepts]: Start accepts. Automaton has 252333 states and 388451 transitions. Word has length 109 [2019-09-10 08:44:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:06,716 INFO L475 AbstractCegarLoop]: Abstraction has 252333 states and 388451 transitions. [2019-09-10 08:44:06,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 252333 states and 388451 transitions. [2019-09-10 08:44:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:44:06,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:06,719 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:06,719 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:06,719 INFO L82 PathProgramCache]: Analyzing trace with hash -797632121, now seen corresponding path program 1 times [2019-09-10 08:44:06,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:06,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:06,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:06,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:06,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:44:06,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:06,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:06,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:06,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:06,773 INFO L87 Difference]: Start difference. First operand 252333 states and 388451 transitions. Second operand 3 states. [2019-09-10 08:44:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:09,370 INFO L93 Difference]: Finished difference Result 504618 states and 776822 transitions. [2019-09-10 08:44:09,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:09,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 08:44:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:10,270 INFO L225 Difference]: With dead ends: 504618 [2019-09-10 08:44:10,270 INFO L226 Difference]: Without dead ends: 504618 [2019-09-10 08:44:10,270 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 08:44:10,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504618 states. [2019-09-10 08:44:18,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504618 to 252339. [2019-09-10 08:44:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252339 states. [2019-09-10 08:44:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252339 states to 252339 states and 388459 transitions. [2019-09-10 08:44:18,786 INFO L78 Accepts]: Start accepts. Automaton has 252339 states and 388459 transitions. Word has length 109 [2019-09-10 08:44:18,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:18,786 INFO L475 AbstractCegarLoop]: Abstraction has 252339 states and 388459 transitions. [2019-09-10 08:44:18,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 252339 states and 388459 transitions. [2019-09-10 08:44:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:44:18,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:18,789 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:18,789 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:18,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:18,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1127309638, now seen corresponding path program 1 times [2019-09-10 08:44:18,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:18,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:18,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:18,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:18,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:44:18,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:18,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:18,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:18,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:18,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:18,832 INFO L87 Difference]: Start difference. First operand 252339 states and 388459 transitions. Second operand 3 states. [2019-09-10 08:44:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:25,646 INFO L93 Difference]: Finished difference Result 504620 states and 776824 transitions. [2019-09-10 08:44:25,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:25,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 08:44:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:26,455 INFO L225 Difference]: With dead ends: 504620 [2019-09-10 08:44:26,455 INFO L226 Difference]: Without dead ends: 504620 [2019-09-10 08:44:26,456 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 08:44:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504620 states. [2019-09-10 08:44:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504620 to 252341. [2019-09-10 08:44:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252341 states. [2019-09-10 08:44:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252341 states to 252341 states and 388461 transitions. [2019-09-10 08:44:31,396 INFO L78 Accepts]: Start accepts. Automaton has 252341 states and 388461 transitions. Word has length 109 [2019-09-10 08:44:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:31,396 INFO L475 AbstractCegarLoop]: Abstraction has 252341 states and 388461 transitions. [2019-09-10 08:44:31,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 252341 states and 388461 transitions. [2019-09-10 08:44:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:44:31,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:31,398 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:31,399 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:31,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:31,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1417132731, now seen corresponding path program 1 times [2019-09-10 08:44:31,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:31,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:31,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:31,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:31,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:44:31,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:31,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:31,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:31,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:31,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:31,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:31,448 INFO L87 Difference]: Start difference. First operand 252341 states and 388461 transitions. Second operand 3 states. [2019-09-10 08:44:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:34,012 INFO L93 Difference]: Finished difference Result 504650 states and 776870 transitions. [2019-09-10 08:44:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:34,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 08:44:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:34,815 INFO L225 Difference]: With dead ends: 504650 [2019-09-10 08:44:34,815 INFO L226 Difference]: Without dead ends: 504650 [2019-09-10 08:44:34,816 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 08:44:35,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504650 states. [2019-09-10 08:44:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504650 to 252347. [2019-09-10 08:44:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252347 states. [2019-09-10 08:44:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252347 states to 252347 states and 388469 transitions. [2019-09-10 08:44:44,478 INFO L78 Accepts]: Start accepts. Automaton has 252347 states and 388469 transitions. Word has length 109 [2019-09-10 08:44:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:44,478 INFO L475 AbstractCegarLoop]: Abstraction has 252347 states and 388469 transitions. [2019-09-10 08:44:44,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:44,479 INFO L276 IsEmpty]: Start isEmpty. Operand 252347 states and 388469 transitions. [2019-09-10 08:44:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:44:44,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:44,480 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:44,480 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:44,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1274804930, now seen corresponding path program 1 times [2019-09-10 08:44:44,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:44,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:44,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:44,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:44,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:44:44,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:44,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:44,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:44,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:44,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:44,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:44,525 INFO L87 Difference]: Start difference. First operand 252347 states and 388469 transitions. Second operand 3 states. [2019-09-10 08:44:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:46,766 INFO L93 Difference]: Finished difference Result 504676 states and 776910 transitions. [2019-09-10 08:44:46,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:46,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 08:44:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:47,537 INFO L225 Difference]: With dead ends: 504676 [2019-09-10 08:44:47,537 INFO L226 Difference]: Without dead ends: 504676 [2019-09-10 08:44:47,537 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 08:44:47,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504676 states. [2019-09-10 08:44:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504676 to 252349. [2019-09-10 08:44:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252349 states. [2019-09-10 08:44:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252349 states to 252349 states and 388471 transitions. [2019-09-10 08:44:57,097 INFO L78 Accepts]: Start accepts. Automaton has 252349 states and 388471 transitions. Word has length 109 [2019-09-10 08:44:57,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:57,098 INFO L475 AbstractCegarLoop]: Abstraction has 252349 states and 388471 transitions. [2019-09-10 08:44:57,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 252349 states and 388471 transitions. [2019-09-10 08:44:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:44:57,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:57,099 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:57,100 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:57,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:57,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1213312932, now seen corresponding path program 1 times [2019-09-10 08:44:57,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:57,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:57,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:57,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:57,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:44:57,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:57,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:57,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:57,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:57,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:57,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:57,182 INFO L87 Difference]: Start difference. First operand 252349 states and 388471 transitions. Second operand 4 states. [2019-09-10 08:44:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:58,855 INFO L93 Difference]: Finished difference Result 278021 states and 428167 transitions. [2019-09-10 08:44:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:58,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-10 08:44:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:59,237 INFO L225 Difference]: With dead ends: 278021 [2019-09-10 08:44:59,237 INFO L226 Difference]: Without dead ends: 278021 [2019-09-10 08:44:59,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278021 states. [2019-09-10 08:45:06,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278021 to 277811. [2019-09-10 08:45:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277811 states. [2019-09-10 08:45:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277811 states to 277811 states and 427959 transitions. [2019-09-10 08:45:06,454 INFO L78 Accepts]: Start accepts. Automaton has 277811 states and 427959 transitions. Word has length 110 [2019-09-10 08:45:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:06,454 INFO L475 AbstractCegarLoop]: Abstraction has 277811 states and 427959 transitions. [2019-09-10 08:45:06,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 277811 states and 427959 transitions. [2019-09-10 08:45:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:45:06,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:06,456 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:06,456 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:06,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:06,456 INFO L82 PathProgramCache]: Analyzing trace with hash 400265209, now seen corresponding path program 1 times [2019-09-10 08:45:06,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:06,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:06,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:06,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:06,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:45:06,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:06,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:06,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:06,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:06,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:06,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:06,519 INFO L87 Difference]: Start difference. First operand 277811 states and 427959 transitions. Second operand 3 states. [2019-09-10 08:45:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:08,793 INFO L93 Difference]: Finished difference Result 542170 states and 828602 transitions. [2019-09-10 08:45:08,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:08,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 08:45:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:09,719 INFO L225 Difference]: With dead ends: 542170 [2019-09-10 08:45:09,720 INFO L226 Difference]: Without dead ends: 542170 [2019-09-10 08:45:09,720 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 08:45:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542170 states. [2019-09-10 08:45:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542170 to 542168. [2019-09-10 08:45:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542168 states. [2019-09-10 08:45:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542168 states to 542168 states and 828601 transitions. [2019-09-10 08:45:22,917 INFO L78 Accepts]: Start accepts. Automaton has 542168 states and 828601 transitions. Word has length 110 [2019-09-10 08:45:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:22,918 INFO L475 AbstractCegarLoop]: Abstraction has 542168 states and 828601 transitions. [2019-09-10 08:45:22,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 542168 states and 828601 transitions. [2019-09-10 08:45:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:45:22,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:22,920 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:22,921 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:22,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:22,921 INFO L82 PathProgramCache]: Analyzing trace with hash -589075645, now seen corresponding path program 1 times [2019-09-10 08:45:22,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:22,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:22,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:22,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:22,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:22,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:22,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:45:22,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:22,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:45:22,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:45:22,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:45:22,990 INFO L87 Difference]: Start difference. First operand 542168 states and 828601 transitions. Second operand 3 states. [2019-09-10 08:45:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:33,124 INFO L93 Difference]: Finished difference Result 1052183 states and 1593072 transitions. [2019-09-10 08:45:33,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:45:33,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 08:45:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:35,009 INFO L225 Difference]: With dead ends: 1052183 [2019-09-10 08:45:35,009 INFO L226 Difference]: Without dead ends: 1052183 [2019-09-10 08:45:35,010 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 08:45:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052183 states. [2019-09-10 08:46:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052183 to 1051965. [2019-09-10 08:46:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051965 states. [2019-09-10 08:46:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051965 states to 1051965 states and 1592855 transitions. [2019-09-10 08:46:08,245 INFO L78 Accepts]: Start accepts. Automaton has 1051965 states and 1592855 transitions. Word has length 110 [2019-09-10 08:46:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:08,245 INFO L475 AbstractCegarLoop]: Abstraction has 1051965 states and 1592855 transitions. [2019-09-10 08:46:08,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:46:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1051965 states and 1592855 transitions. [2019-09-10 08:46:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:46:08,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:08,251 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:08,251 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:08,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:08,252 INFO L82 PathProgramCache]: Analyzing trace with hash -244340709, now seen corresponding path program 1 times [2019-09-10 08:46:08,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:08,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:08,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:08,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:08,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:46:08,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:08,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:46:08,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:08,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:46:08,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:46:08,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:46:08,304 INFO L87 Difference]: Start difference. First operand 1051965 states and 1592855 transitions. Second operand 3 states. [2019-09-10 08:46:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:27,022 INFO L93 Difference]: Finished difference Result 1377107 states and 2073953 transitions. [2019-09-10 08:46:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:46:27,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:46:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:29,306 INFO L225 Difference]: With dead ends: 1377107 [2019-09-10 08:46:29,306 INFO L226 Difference]: Without dead ends: 1377107 [2019-09-10 08:46:29,307 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 08:46:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377107 states. [2019-09-10 08:47:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377107 to 1340317. [2019-09-10 08:47:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340317 states. [2019-09-10 08:47:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340317 states to 1340317 states and 2007804 transitions. [2019-09-10 08:47:24,559 INFO L78 Accepts]: Start accepts. Automaton has 1340317 states and 2007804 transitions. Word has length 111 [2019-09-10 08:47:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:24,560 INFO L475 AbstractCegarLoop]: Abstraction has 1340317 states and 2007804 transitions. [2019-09-10 08:47:24,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1340317 states and 2007804 transitions. [2019-09-10 08:47:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:47:24,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:24,564 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:24,564 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:24,564 INFO L82 PathProgramCache]: Analyzing trace with hash -428773387, now seen corresponding path program 1 times [2019-09-10 08:47:24,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:24,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:24,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:24,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:24,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:24,634 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:47:24,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:24,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:24,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:24,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:24,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:24,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:24,636 INFO L87 Difference]: Start difference. First operand 1340317 states and 2007804 transitions. Second operand 3 states. [2019-09-10 08:47:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:26,334 INFO L93 Difference]: Finished difference Result 564993 states and 840175 transitions. [2019-09-10 08:47:26,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:26,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:47:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:35,140 INFO L225 Difference]: With dead ends: 564993 [2019-09-10 08:47:35,140 INFO L226 Difference]: Without dead ends: 564993 [2019-09-10 08:47:35,141 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 08:47:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564993 states. [2019-09-10 08:47:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564993 to 564167. [2019-09-10 08:47:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564167 states. [2019-09-10 08:47:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564167 states to 564167 states and 839082 transitions. [2019-09-10 08:47:42,150 INFO L78 Accepts]: Start accepts. Automaton has 564167 states and 839082 transitions. Word has length 111 [2019-09-10 08:47:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:42,150 INFO L475 AbstractCegarLoop]: Abstraction has 564167 states and 839082 transitions. [2019-09-10 08:47:42,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:47:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 564167 states and 839082 transitions. [2019-09-10 08:47:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:47:42,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:42,154 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:42,155 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:42,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:42,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2032119882, now seen corresponding path program 1 times [2019-09-10 08:47:42,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:42,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:42,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:42,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:42,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:47:43,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:43,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:43,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:43,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:43,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:43,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:43,711 INFO L87 Difference]: Start difference. First operand 564167 states and 839082 transitions. Second operand 3 states. [2019-09-10 08:47:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:54,787 INFO L93 Difference]: Finished difference Result 803553 states and 1186801 transitions. [2019-09-10 08:47:54,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:54,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:47:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:56,054 INFO L225 Difference]: With dead ends: 803553 [2019-09-10 08:47:56,055 INFO L226 Difference]: Without dead ends: 803553 [2019-09-10 08:47:56,055 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 08:47:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803553 states. [2019-09-10 08:48:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803553 to 570031. [2019-09-10 08:48:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570031 states. [2019-09-10 08:48:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570031 states to 570031 states and 847874 transitions. [2019-09-10 08:48:04,577 INFO L78 Accepts]: Start accepts. Automaton has 570031 states and 847874 transitions. Word has length 111 [2019-09-10 08:48:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:04,578 INFO L475 AbstractCegarLoop]: Abstraction has 570031 states and 847874 transitions. [2019-09-10 08:48:04,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:04,578 INFO L276 IsEmpty]: Start isEmpty. Operand 570031 states and 847874 transitions. [2019-09-10 08:48:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 08:48:04,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:04,581 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:48:04,581 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:04,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:04,581 INFO L82 PathProgramCache]: Analyzing trace with hash -928839182, now seen corresponding path program 1 times [2019-09-10 08:48:04,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:04,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:04,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:04,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:04,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:48:04,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:48:04,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:48:04,696 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 113 with the following transitions: [2019-09-10 08:48:04,697 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [145], [153], [155], [158], [173], [181], [183], [186], [201], [209], [211], [214], [217], [220], [223], [226], [230], [238], [240], [243], [244], [246], [255], [258], [262], [267], [269], [272], [286], [290], [294], [296], [299], [330], [340], [350], [356], [360], [364], [366], [369], [400], [410], [420], [426], [430], [434], [436], [439], [470], [480], [490], [605], [606], [610], [611], [612] [2019-09-10 08:48:04,701 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:48:04,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:48:04,728 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:48:06,430 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:48:06,431 INFO L272 AbstractInterpreter]: Visited 103 different actions 613 times. Merged at 54 different actions 452 times. Widened at 25 different actions 85 times. Performed 1864 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1864 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 16 different actions. Largest state had 174 variables. [2019-09-10 08:48:06,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:06,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:48:06,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:48:06,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:48:06,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:06,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:48:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:06,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:48:06,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:48:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:48:06,651 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:48:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:48:06,714 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:48:06,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 7 [2019-09-10 08:48:06,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:06,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:06,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:06,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:48:06,716 INFO L87 Difference]: Start difference. First operand 570031 states and 847874 transitions. Second operand 4 states. [2019-09-10 08:48:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:17,077 INFO L93 Difference]: Finished difference Result 1105357 states and 1628557 transitions. [2019-09-10 08:48:17,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:17,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-10 08:48:17,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:18,822 INFO L225 Difference]: With dead ends: 1105357 [2019-09-10 08:48:18,822 INFO L226 Difference]: Without dead ends: 1105357 [2019-09-10 08:48:18,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:48:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105357 states. [2019-09-10 08:48:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105357 to 1105355. [2019-09-10 08:48:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105355 states. [2019-09-10 08:48:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105355 states to 1105355 states and 1628556 transitions. [2019-09-10 08:48:52,228 INFO L78 Accepts]: Start accepts. Automaton has 1105355 states and 1628556 transitions. Word has length 112 [2019-09-10 08:48:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:52,228 INFO L475 AbstractCegarLoop]: Abstraction has 1105355 states and 1628556 transitions. [2019-09-10 08:48:52,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:48:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1105355 states and 1628556 transitions. [2019-09-10 08:48:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:48:52,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:52,233 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:48:52,233 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:52,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:52,234 INFO L82 PathProgramCache]: Analyzing trace with hash -41089377, now seen corresponding path program 1 times [2019-09-10 08:48:52,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:52,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:52,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:52,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:52,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 08:48:52,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:48:52,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:48:52,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:52,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:52,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:52,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:48:52,365 INFO L87 Difference]: Start difference. First operand 1105355 states and 1628556 transitions. Second operand 4 states. [2019-09-10 08:48:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:56,651 INFO L93 Difference]: Finished difference Result 1105519 states and 1628738 transitions. [2019-09-10 08:48:56,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:56,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-10 08:48:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:00,761 INFO L225 Difference]: With dead ends: 1105519 [2019-09-10 08:49:00,761 INFO L226 Difference]: Without dead ends: 1105355 [2019-09-10 08:49:00,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:49:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105355 states. [2019-09-10 08:49:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105355 to 1105352. [2019-09-10 08:49:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105352 states. [2019-09-10 08:49:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105352 states to 1105352 states and 1628547 transitions. [2019-09-10 08:49:31,310 INFO L78 Accepts]: Start accepts. Automaton has 1105352 states and 1628547 transitions. Word has length 113 [2019-09-10 08:49:31,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:31,311 INFO L475 AbstractCegarLoop]: Abstraction has 1105352 states and 1628547 transitions. [2019-09-10 08:49:31,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1105352 states and 1628547 transitions. [2019-09-10 08:49:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:49:31,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:31,315 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:31,315 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:31,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1600813266, now seen corresponding path program 1 times [2019-09-10 08:49:31,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:31,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:31,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:31,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:31,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:49:31,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:31,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:49:31,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:31,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:49:31,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:49:31,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:49:31,442 INFO L87 Difference]: Start difference. First operand 1105352 states and 1628547 transitions. Second operand 4 states. [2019-09-10 08:49:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:45,435 INFO L93 Difference]: Finished difference Result 1423706 states and 2092652 transitions. [2019-09-10 08:49:45,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:49:45,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-10 08:49:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:49,429 INFO L225 Difference]: With dead ends: 1423706 [2019-09-10 08:49:49,429 INFO L226 Difference]: Without dead ends: 1423706 [2019-09-10 08:49:49,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:49:50,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423706 states. [2019-09-10 08:50:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423706 to 1105072. [2019-09-10 08:50:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105072 states. [2019-09-10 08:50:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105072 states to 1105072 states and 1628099 transitions. [2019-09-10 08:50:26,699 INFO L78 Accepts]: Start accepts. Automaton has 1105072 states and 1628099 transitions. Word has length 113 [2019-09-10 08:50:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:26,699 INFO L475 AbstractCegarLoop]: Abstraction has 1105072 states and 1628099 transitions. [2019-09-10 08:50:26,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1105072 states and 1628099 transitions. [2019-09-10 08:50:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:50:26,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:26,706 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:26,706 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:26,706 INFO L82 PathProgramCache]: Analyzing trace with hash 926903463, now seen corresponding path program 1 times [2019-09-10 08:50:26,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:26,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:26,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:26,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:26,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:50:26,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:26,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:26,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:26,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:26,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:26,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:26,778 INFO L87 Difference]: Start difference. First operand 1105072 states and 1628099 transitions. Second operand 3 states. [2019-09-10 08:50:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:43,381 INFO L93 Difference]: Finished difference Result 2065647 states and 3014049 transitions. [2019-09-10 08:50:43,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:43,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 08:50:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:47,029 INFO L225 Difference]: With dead ends: 2065647 [2019-09-10 08:50:47,030 INFO L226 Difference]: Without dead ends: 2065647 [2019-09-10 08:50:47,030 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 08:50:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065647 states.