java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:58:46,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:58:46,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:58:46,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:58:46,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:58:46,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:58:46,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:58:46,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:58:46,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:58:46,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:58:46,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:58:46,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:58:46,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:58:46,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:58:46,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:58:46,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:58:46,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:58:46,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:58:46,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:58:46,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:58:46,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:58:46,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:58:46,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:58:46,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:58:46,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:58:46,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:58:46,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:58:46,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:58:46,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:58:46,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:58:46,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:58:46,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:58:46,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:58:46,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:58:46,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:58:46,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:58:46,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:58:46,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:58:46,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:58:46,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:58:46,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:58:46,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:58:46,949 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:58:46,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:58:46,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:58:46,950 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:58:46,951 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:58:46,951 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:58:46,951 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:58:46,952 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:58:46,952 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:58:46,952 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:58:46,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:58:46,954 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:58:46,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:58:46,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:58:46,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:58:46,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:58:46,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:58:46,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:58:46,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:58:46,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:58:46,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:58:46,956 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:58:46,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:58:46,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:58:46,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:58:46,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:58:46,958 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:58:46,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:58:46,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:58:46,958 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:58:47,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:58:47,025 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:58:47,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:58:47,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:58:47,032 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:58:47,033 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:58:47,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af540fa0/123686aa9eb24475839f78f060a83fd9/FLAGb4032789e [2019-09-10 06:58:47,580 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:58:47,581 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:58:47,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af540fa0/123686aa9eb24475839f78f060a83fd9/FLAGb4032789e [2019-09-10 06:58:47,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af540fa0/123686aa9eb24475839f78f060a83fd9 [2019-09-10 06:58:47,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:58:47,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:58:47,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:58:47,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:58:47,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:58:47,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:58:47" (1/1) ... [2019-09-10 06:58:47,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3358d7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:47, skipping insertion in model container [2019-09-10 06:58:47,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:58:47" (1/1) ... [2019-09-10 06:58:47,952 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:58:48,019 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:58:48,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:58:48,454 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:58:48,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:58:48,568 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:58:48,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:48 WrapperNode [2019-09-10 06:58:48,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:58:48,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:58:48,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:58:48,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:58:48,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:48" (1/1) ... [2019-09-10 06:58:48,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:48" (1/1) ... [2019-09-10 06:58:48,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:48" (1/1) ... [2019-09-10 06:58:48,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:48" (1/1) ... [2019-09-10 06:58:48,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:48" (1/1) ... [2019-09-10 06:58:48,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:48" (1/1) ... [2019-09-10 06:58:48,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:48" (1/1) ... [2019-09-10 06:58:48,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:58:48,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:58:48,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:58:48,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:58:48,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:58:48,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:58:48,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:58:48,720 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:58:48,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:58:48,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:58:48,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:58:48,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:58:48,721 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:58:48,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:58:48,721 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:58:48,722 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:58:48,722 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:58:48,722 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:58:48,723 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:58:48,724 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:58:48,724 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:58:48,725 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:58:48,725 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:58:48,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:58:48,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:58:49,591 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:58:49,591 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:58:49,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:58:49 BoogieIcfgContainer [2019-09-10 06:58:49,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:58:49,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:58:49,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:58:49,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:58:49,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:58:47" (1/3) ... [2019-09-10 06:58:49,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25cbddb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:58:49, skipping insertion in model container [2019-09-10 06:58:49,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:58:48" (2/3) ... [2019-09-10 06:58:49,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25cbddb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:58:49, skipping insertion in model container [2019-09-10 06:58:49,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:58:49" (3/3) ... [2019-09-10 06:58:49,602 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:58:49,612 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:58:49,621 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:58:49,639 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:58:49,666 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:58:49,666 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:58:49,666 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:58:49,666 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:58:49,667 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:58:49,667 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:58:49,667 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:58:49,667 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:58:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states. [2019-09-10 06:58:49,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:58:49,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:49,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:49,705 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash 988898761, now seen corresponding path program 1 times [2019-09-10 06:58:49,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:49,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:49,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:49,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:49,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:50,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:50,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:58:50,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:50,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:58:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:58:50,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:58:50,269 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 7 states. [2019-09-10 06:58:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:50,747 INFO L93 Difference]: Finished difference Result 985 states and 1560 transitions. [2019-09-10 06:58:50,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:58:50,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-09-10 06:58:50,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:50,772 INFO L225 Difference]: With dead ends: 985 [2019-09-10 06:58:50,772 INFO L226 Difference]: Without dead ends: 965 [2019-09-10 06:58:50,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:58:50,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2019-09-10 06:58:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 485. [2019-09-10 06:58:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-10 06:58:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 748 transitions. [2019-09-10 06:58:50,879 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 748 transitions. Word has length 67 [2019-09-10 06:58:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:50,880 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 748 transitions. [2019-09-10 06:58:50,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:58:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 748 transitions. [2019-09-10 06:58:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:58:50,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:50,887 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:50,888 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:50,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:50,889 INFO L82 PathProgramCache]: Analyzing trace with hash 329671807, now seen corresponding path program 1 times [2019-09-10 06:58:50,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:50,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:50,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:50,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:50,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:51,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:51,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:58:51,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:51,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:58:51,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:58:51,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:58:51,140 INFO L87 Difference]: Start difference. First operand 485 states and 748 transitions. Second operand 6 states. [2019-09-10 06:58:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:51,368 INFO L93 Difference]: Finished difference Result 1322 states and 2041 transitions. [2019-09-10 06:58:51,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:58:51,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-10 06:58:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:51,376 INFO L225 Difference]: With dead ends: 1322 [2019-09-10 06:58:51,377 INFO L226 Difference]: Without dead ends: 1322 [2019-09-10 06:58:51,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:58:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-09-10 06:58:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1316. [2019-09-10 06:58:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-09-10 06:58:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2038 transitions. [2019-09-10 06:58:51,428 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2038 transitions. Word has length 68 [2019-09-10 06:58:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:51,430 INFO L475 AbstractCegarLoop]: Abstraction has 1316 states and 2038 transitions. [2019-09-10 06:58:51,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:58:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2038 transitions. [2019-09-10 06:58:51,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:58:51,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:51,437 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:51,437 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1962630653, now seen corresponding path program 1 times [2019-09-10 06:58:51,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:51,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:51,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:51,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:51,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:51,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:51,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:58:51,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:51,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:58:51,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:58:51,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:58:51,563 INFO L87 Difference]: Start difference. First operand 1316 states and 2038 transitions. Second operand 6 states. [2019-09-10 06:58:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:51,947 INFO L93 Difference]: Finished difference Result 3445 states and 5355 transitions. [2019-09-10 06:58:51,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:58:51,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 06:58:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:51,977 INFO L225 Difference]: With dead ends: 3445 [2019-09-10 06:58:51,977 INFO L226 Difference]: Without dead ends: 3445 [2019-09-10 06:58:51,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:58:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2019-09-10 06:58:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3441. [2019-09-10 06:58:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3441 states. [2019-09-10 06:58:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 5353 transitions. [2019-09-10 06:58:52,076 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 5353 transitions. Word has length 69 [2019-09-10 06:58:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:52,080 INFO L475 AbstractCegarLoop]: Abstraction has 3441 states and 5353 transitions. [2019-09-10 06:58:52,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:58:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 5353 transitions. [2019-09-10 06:58:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:58:52,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:52,086 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:52,086 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash -209027553, now seen corresponding path program 1 times [2019-09-10 06:58:52,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:52,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:52,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:52,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:52,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:52,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:52,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:58:52,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:52,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:58:52,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:58:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:58:52,322 INFO L87 Difference]: Start difference. First operand 3441 states and 5353 transitions. Second operand 6 states. [2019-09-10 06:58:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:52,699 INFO L93 Difference]: Finished difference Result 9319 states and 14502 transitions. [2019-09-10 06:58:52,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:58:52,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 06:58:52,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:52,756 INFO L225 Difference]: With dead ends: 9319 [2019-09-10 06:58:52,757 INFO L226 Difference]: Without dead ends: 9319 [2019-09-10 06:58:52,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:58:52,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9319 states. [2019-09-10 06:58:52,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9319 to 8300. [2019-09-10 06:58:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8300 states. [2019-09-10 06:58:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8300 states to 8300 states and 12908 transitions. [2019-09-10 06:58:52,994 INFO L78 Accepts]: Start accepts. Automaton has 8300 states and 12908 transitions. Word has length 69 [2019-09-10 06:58:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:52,995 INFO L475 AbstractCegarLoop]: Abstraction has 8300 states and 12908 transitions. [2019-09-10 06:58:52,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:58:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 8300 states and 12908 transitions. [2019-09-10 06:58:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:58:52,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:52,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:52,998 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:52,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1468610574, now seen corresponding path program 1 times [2019-09-10 06:58:52,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:53,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:53,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:53,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:53,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:58:53,154 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:53,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:58:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:58:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:58:53,156 INFO L87 Difference]: Start difference. First operand 8300 states and 12908 transitions. Second operand 6 states. [2019-09-10 06:58:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:53,546 INFO L93 Difference]: Finished difference Result 23590 states and 36516 transitions. [2019-09-10 06:58:53,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:58:53,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-10 06:58:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:53,655 INFO L225 Difference]: With dead ends: 23590 [2019-09-10 06:58:53,656 INFO L226 Difference]: Without dead ends: 23590 [2019-09-10 06:58:53,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:58:53,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23590 states. [2019-09-10 06:58:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23590 to 23586. [2019-09-10 06:58:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23586 states. [2019-09-10 06:58:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23586 states to 23586 states and 36514 transitions. [2019-09-10 06:58:54,411 INFO L78 Accepts]: Start accepts. Automaton has 23586 states and 36514 transitions. Word has length 69 [2019-09-10 06:58:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:54,411 INFO L475 AbstractCegarLoop]: Abstraction has 23586 states and 36514 transitions. [2019-09-10 06:58:54,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:58:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 23586 states and 36514 transitions. [2019-09-10 06:58:54,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:58:54,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:54,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:54,417 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:54,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:54,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1910586809, now seen corresponding path program 1 times [2019-09-10 06:58:54,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:54,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:54,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:54,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:54,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:54,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:54,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:58:54,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:54,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:58:54,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:58:54,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:58:54,542 INFO L87 Difference]: Start difference. First operand 23586 states and 36514 transitions. Second operand 5 states. [2019-09-10 06:58:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:55,664 INFO L93 Difference]: Finished difference Result 41436 states and 63750 transitions. [2019-09-10 06:58:55,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:58:55,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-10 06:58:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:55,790 INFO L225 Difference]: With dead ends: 41436 [2019-09-10 06:58:55,790 INFO L226 Difference]: Without dead ends: 41436 [2019-09-10 06:58:55,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:58:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41436 states. [2019-09-10 06:58:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41436 to 41434. [2019-09-10 06:58:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41434 states. [2019-09-10 06:58:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41434 states to 41434 states and 63749 transitions. [2019-09-10 06:58:56,566 INFO L78 Accepts]: Start accepts. Automaton has 41434 states and 63749 transitions. Word has length 70 [2019-09-10 06:58:56,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:56,567 INFO L475 AbstractCegarLoop]: Abstraction has 41434 states and 63749 transitions. [2019-09-10 06:58:56,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:58:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 41434 states and 63749 transitions. [2019-09-10 06:58:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 06:58:56,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:56,575 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:56,576 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:56,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1298147562, now seen corresponding path program 1 times [2019-09-10 06:58:56,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:56,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:56,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:56,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:56,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:56,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:56,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:58:56,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:56,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:58:56,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:58:56,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:58:56,674 INFO L87 Difference]: Start difference. First operand 41434 states and 63749 transitions. Second operand 5 states. [2019-09-10 06:58:57,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:58:57,010 INFO L93 Difference]: Finished difference Result 69037 states and 105032 transitions. [2019-09-10 06:58:57,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:58:57,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-10 06:58:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:58:57,226 INFO L225 Difference]: With dead ends: 69037 [2019-09-10 06:58:57,227 INFO L226 Difference]: Without dead ends: 69037 [2019-09-10 06:58:57,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 06:58:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69037 states. [2019-09-10 06:58:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69037 to 42118. [2019-09-10 06:58:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42118 states. [2019-09-10 06:58:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42118 states to 42118 states and 64226 transitions. [2019-09-10 06:58:59,516 INFO L78 Accepts]: Start accepts. Automaton has 42118 states and 64226 transitions. Word has length 70 [2019-09-10 06:58:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:58:59,518 INFO L475 AbstractCegarLoop]: Abstraction has 42118 states and 64226 transitions. [2019-09-10 06:58:59,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:58:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 42118 states and 64226 transitions. [2019-09-10 06:58:59,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:58:59,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:58:59,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:58:59,524 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:58:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:58:59,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1848209620, now seen corresponding path program 1 times [2019-09-10 06:58:59,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:58:59,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:59,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:58:59,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:58:59,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:58:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:58:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:58:59,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:58:59,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:58:59,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:58:59,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:58:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:58:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:58:59,785 INFO L87 Difference]: Start difference. First operand 42118 states and 64226 transitions. Second operand 10 states. [2019-09-10 06:59:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:03,440 INFO L93 Difference]: Finished difference Result 333655 states and 509005 transitions. [2019-09-10 06:59:03,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:59:03,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-09-10 06:59:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:04,243 INFO L225 Difference]: With dead ends: 333655 [2019-09-10 06:59:04,244 INFO L226 Difference]: Without dead ends: 333655 [2019-09-10 06:59:04,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:59:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333655 states. [2019-09-10 06:59:08,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333655 to 42278. [2019-09-10 06:59:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42278 states. [2019-09-10 06:59:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42278 states to 42278 states and 64428 transitions. [2019-09-10 06:59:08,156 INFO L78 Accepts]: Start accepts. Automaton has 42278 states and 64428 transitions. Word has length 71 [2019-09-10 06:59:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:08,157 INFO L475 AbstractCegarLoop]: Abstraction has 42278 states and 64428 transitions. [2019-09-10 06:59:08,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 42278 states and 64428 transitions. [2019-09-10 06:59:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:59:08,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:08,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:08,163 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:08,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:08,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1085831572, now seen corresponding path program 1 times [2019-09-10 06:59:08,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:08,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:08,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:08,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:08,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:08,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:08,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:59:08,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:08,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:59:08,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:59:08,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:59:08,351 INFO L87 Difference]: Start difference. First operand 42278 states and 64428 transitions. Second operand 10 states. [2019-09-10 06:59:10,683 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-09-10 06:59:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:11,233 INFO L93 Difference]: Finished difference Result 252588 states and 384189 transitions. [2019-09-10 06:59:11,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:59:11,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-09-10 06:59:11,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:11,673 INFO L225 Difference]: With dead ends: 252588 [2019-09-10 06:59:11,673 INFO L226 Difference]: Without dead ends: 252588 [2019-09-10 06:59:11,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=845, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:59:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252588 states. [2019-09-10 06:59:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252588 to 42278. [2019-09-10 06:59:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42278 states. [2019-09-10 06:59:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42278 states to 42278 states and 64426 transitions. [2019-09-10 06:59:15,054 INFO L78 Accepts]: Start accepts. Automaton has 42278 states and 64426 transitions. Word has length 71 [2019-09-10 06:59:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:15,054 INFO L475 AbstractCegarLoop]: Abstraction has 42278 states and 64426 transitions. [2019-09-10 06:59:15,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 42278 states and 64426 transitions. [2019-09-10 06:59:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:59:15,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:15,060 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:15,060 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:15,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:15,060 INFO L82 PathProgramCache]: Analyzing trace with hash -218819276, now seen corresponding path program 1 times [2019-09-10 06:59:15,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:15,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:15,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:15,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:15,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:15,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:15,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:59:15,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:15,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:59:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:59:15,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:59:15,295 INFO L87 Difference]: Start difference. First operand 42278 states and 64426 transitions. Second operand 10 states. [2019-09-10 06:59:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:18,655 INFO L93 Difference]: Finished difference Result 282969 states and 430950 transitions. [2019-09-10 06:59:18,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 06:59:18,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-09-10 06:59:18,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:19,026 INFO L225 Difference]: With dead ends: 282969 [2019-09-10 06:59:19,027 INFO L226 Difference]: Without dead ends: 282969 [2019-09-10 06:59:19,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=1180, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 06:59:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282969 states. [2019-09-10 06:59:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282969 to 42627. [2019-09-10 06:59:20,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42627 states. [2019-09-10 06:59:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42627 states to 42627 states and 64869 transitions. [2019-09-10 06:59:20,857 INFO L78 Accepts]: Start accepts. Automaton has 42627 states and 64869 transitions. Word has length 71 [2019-09-10 06:59:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:20,857 INFO L475 AbstractCegarLoop]: Abstraction has 42627 states and 64869 transitions. [2019-09-10 06:59:20,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 42627 states and 64869 transitions. [2019-09-10 06:59:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:59:20,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:20,862 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:20,862 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:20,863 INFO L82 PathProgramCache]: Analyzing trace with hash 114291727, now seen corresponding path program 1 times [2019-09-10 06:59:20,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:20,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:20,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:20,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:20,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:21,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:21,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:59:21,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:21,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:59:21,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:59:21,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:59:21,034 INFO L87 Difference]: Start difference. First operand 42627 states and 64869 transitions. Second operand 10 states. [2019-09-10 06:59:22,352 WARN L188 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-09-10 06:59:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:24,554 INFO L93 Difference]: Finished difference Result 218310 states and 330403 transitions. [2019-09-10 06:59:24,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 06:59:24,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-10 06:59:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:24,968 INFO L225 Difference]: With dead ends: 218310 [2019-09-10 06:59:24,968 INFO L226 Difference]: Without dead ends: 218310 [2019-09-10 06:59:24,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:59:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218310 states. [2019-09-10 06:59:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218310 to 42777. [2019-09-10 06:59:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42777 states. [2019-09-10 06:59:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42777 states to 42777 states and 65036 transitions. [2019-09-10 06:59:26,530 INFO L78 Accepts]: Start accepts. Automaton has 42777 states and 65036 transitions. Word has length 72 [2019-09-10 06:59:26,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:26,530 INFO L475 AbstractCegarLoop]: Abstraction has 42777 states and 65036 transitions. [2019-09-10 06:59:26,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:59:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 42777 states and 65036 transitions. [2019-09-10 06:59:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:59:26,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:26,537 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:26,537 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:26,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash 621370372, now seen corresponding path program 1 times [2019-09-10 06:59:26,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:26,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:26,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:26,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:26,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:26,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:26,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:26,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:26,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:26,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:26,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:26,591 INFO L87 Difference]: Start difference. First operand 42777 states and 65036 transitions. Second operand 3 states. [2019-09-10 06:59:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:26,761 INFO L93 Difference]: Finished difference Result 56125 states and 83957 transitions. [2019-09-10 06:59:26,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:26,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-10 06:59:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:26,869 INFO L225 Difference]: With dead ends: 56125 [2019-09-10 06:59:26,869 INFO L226 Difference]: Without dead ends: 56125 [2019-09-10 06:59:26,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56125 states. [2019-09-10 06:59:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56125 to 55343. [2019-09-10 06:59:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55343 states. [2019-09-10 06:59:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55343 states to 55343 states and 83176 transitions. [2019-09-10 06:59:27,448 INFO L78 Accepts]: Start accepts. Automaton has 55343 states and 83176 transitions. Word has length 72 [2019-09-10 06:59:27,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:27,449 INFO L475 AbstractCegarLoop]: Abstraction has 55343 states and 83176 transitions. [2019-09-10 06:59:27,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 55343 states and 83176 transitions. [2019-09-10 06:59:27,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:59:27,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:27,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:27,452 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:27,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:27,453 INFO L82 PathProgramCache]: Analyzing trace with hash 584174741, now seen corresponding path program 1 times [2019-09-10 06:59:27,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:27,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:27,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:27,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:27,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:27,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:27,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:59:27,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:27,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:59:27,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:59:27,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:59:27,557 INFO L87 Difference]: Start difference. First operand 55343 states and 83176 transitions. Second operand 4 states. [2019-09-10 06:59:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:28,281 INFO L93 Difference]: Finished difference Result 90326 states and 133777 transitions. [2019-09-10 06:59:28,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:59:28,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-10 06:59:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:28,415 INFO L225 Difference]: With dead ends: 90326 [2019-09-10 06:59:28,415 INFO L226 Difference]: Without dead ends: 90326 [2019-09-10 06:59:28,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:59:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90326 states. [2019-09-10 06:59:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90326 to 89598. [2019-09-10 06:59:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89598 states. [2019-09-10 06:59:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89598 states to 89598 states and 133050 transitions. [2019-09-10 06:59:29,239 INFO L78 Accepts]: Start accepts. Automaton has 89598 states and 133050 transitions. Word has length 72 [2019-09-10 06:59:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:29,240 INFO L475 AbstractCegarLoop]: Abstraction has 89598 states and 133050 transitions. [2019-09-10 06:59:29,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:59:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 89598 states and 133050 transitions. [2019-09-10 06:59:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 06:59:29,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:29,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:29,243 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:29,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:29,244 INFO L82 PathProgramCache]: Analyzing trace with hash 984491908, now seen corresponding path program 1 times [2019-09-10 06:59:29,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:29,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:29,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:29,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:29,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:29,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:29,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:29,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:29,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:29,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:29,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:29,295 INFO L87 Difference]: Start difference. First operand 89598 states and 133050 transitions. Second operand 3 states. [2019-09-10 06:59:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:29,622 INFO L93 Difference]: Finished difference Result 122145 states and 178543 transitions. [2019-09-10 06:59:29,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:29,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-10 06:59:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:29,764 INFO L225 Difference]: With dead ends: 122145 [2019-09-10 06:59:29,764 INFO L226 Difference]: Without dead ends: 122145 [2019-09-10 06:59:29,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122145 states. [2019-09-10 06:59:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122145 to 86767. [2019-09-10 06:59:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86767 states. [2019-09-10 06:59:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86767 states to 86767 states and 127106 transitions. [2019-09-10 06:59:31,086 INFO L78 Accepts]: Start accepts. Automaton has 86767 states and 127106 transitions. Word has length 72 [2019-09-10 06:59:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:31,086 INFO L475 AbstractCegarLoop]: Abstraction has 86767 states and 127106 transitions. [2019-09-10 06:59:31,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 86767 states and 127106 transitions. [2019-09-10 06:59:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:59:31,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:31,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:31,090 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:31,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1058462361, now seen corresponding path program 1 times [2019-09-10 06:59:31,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:31,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:31,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:31,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:31,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:59:31,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:31,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:59:31,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:59:31,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:31,141 INFO L87 Difference]: Start difference. First operand 86767 states and 127106 transitions. Second operand 3 states. [2019-09-10 06:59:31,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:31,522 INFO L93 Difference]: Finished difference Result 108106 states and 154375 transitions. [2019-09-10 06:59:31,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:59:31,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 06:59:31,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:31,702 INFO L225 Difference]: With dead ends: 108106 [2019-09-10 06:59:31,702 INFO L226 Difference]: Without dead ends: 108106 [2019-09-10 06:59:31,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:59:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108106 states. [2019-09-10 06:59:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108106 to 106820. [2019-09-10 06:59:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106820 states. [2019-09-10 06:59:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106820 states to 106820 states and 153090 transitions. [2019-09-10 06:59:33,200 INFO L78 Accepts]: Start accepts. Automaton has 106820 states and 153090 transitions. Word has length 73 [2019-09-10 06:59:33,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:33,200 INFO L475 AbstractCegarLoop]: Abstraction has 106820 states and 153090 transitions. [2019-09-10 06:59:33,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:59:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 106820 states and 153090 transitions. [2019-09-10 06:59:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:59:33,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:33,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:33,203 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:33,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:33,203 INFO L82 PathProgramCache]: Analyzing trace with hash 219811643, now seen corresponding path program 1 times [2019-09-10 06:59:33,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:33,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:33,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:33,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:33,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:33,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:33,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:59:33,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:33,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:59:33,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:59:33,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:59:33,294 INFO L87 Difference]: Start difference. First operand 106820 states and 153090 transitions. Second operand 7 states. [2019-09-10 06:59:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:34,336 INFO L93 Difference]: Finished difference Result 266036 states and 381132 transitions. [2019-09-10 06:59:34,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:59:34,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-10 06:59:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:34,684 INFO L225 Difference]: With dead ends: 266036 [2019-09-10 06:59:34,684 INFO L226 Difference]: Without dead ends: 266036 [2019-09-10 06:59:34,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-09-10 06:59:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266036 states. [2019-09-10 06:59:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266036 to 106832. [2019-09-10 06:59:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106832 states. [2019-09-10 06:59:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106832 states to 106832 states and 153106 transitions. [2019-09-10 06:59:38,943 INFO L78 Accepts]: Start accepts. Automaton has 106832 states and 153106 transitions. Word has length 73 [2019-09-10 06:59:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:38,944 INFO L475 AbstractCegarLoop]: Abstraction has 106832 states and 153106 transitions. [2019-09-10 06:59:38,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:59:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 106832 states and 153106 transitions. [2019-09-10 06:59:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 06:59:38,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:38,946 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:38,946 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:38,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1241611993, now seen corresponding path program 1 times [2019-09-10 06:59:38,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:38,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:38,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:38,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:38,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:39,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:39,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:59:39,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:39,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:59:39,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:59:39,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:59:39,019 INFO L87 Difference]: Start difference. First operand 106832 states and 153106 transitions. Second operand 7 states. [2019-09-10 06:59:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:41,216 INFO L93 Difference]: Finished difference Result 388631 states and 551869 transitions. [2019-09-10 06:59:41,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:59:41,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-10 06:59:41,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:41,770 INFO L225 Difference]: With dead ends: 388631 [2019-09-10 06:59:41,770 INFO L226 Difference]: Without dead ends: 388631 [2019-09-10 06:59:41,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:59:42,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388631 states. [2019-09-10 06:59:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388631 to 106978. [2019-09-10 06:59:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106978 states. [2019-09-10 06:59:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106978 states to 106978 states and 153284 transitions. [2019-09-10 06:59:47,542 INFO L78 Accepts]: Start accepts. Automaton has 106978 states and 153284 transitions. Word has length 73 [2019-09-10 06:59:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:47,543 INFO L475 AbstractCegarLoop]: Abstraction has 106978 states and 153284 transitions. [2019-09-10 06:59:47,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:59:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 106978 states and 153284 transitions. [2019-09-10 06:59:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:59:47,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:47,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:47,546 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:47,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash -258690378, now seen corresponding path program 1 times [2019-09-10 06:59:47,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:47,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:47,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:47,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:47,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:47,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:47,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:59:47,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:47,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:59:47,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:59:47,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:59:47,622 INFO L87 Difference]: Start difference. First operand 106978 states and 153284 transitions. Second operand 7 states. [2019-09-10 06:59:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:48,873 INFO L93 Difference]: Finished difference Result 381700 states and 540887 transitions. [2019-09-10 06:59:48,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 06:59:48,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 06:59:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:49,358 INFO L225 Difference]: With dead ends: 381700 [2019-09-10 06:59:49,358 INFO L226 Difference]: Without dead ends: 381700 [2019-09-10 06:59:49,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 06:59:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381700 states. [2019-09-10 06:59:52,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381700 to 107028. [2019-09-10 06:59:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107028 states. [2019-09-10 06:59:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107028 states to 107028 states and 153344 transitions. [2019-09-10 06:59:52,221 INFO L78 Accepts]: Start accepts. Automaton has 107028 states and 153344 transitions. Word has length 74 [2019-09-10 06:59:52,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:52,222 INFO L475 AbstractCegarLoop]: Abstraction has 107028 states and 153344 transitions. [2019-09-10 06:59:52,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:59:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 107028 states and 153344 transitions. [2019-09-10 06:59:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:59:52,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:52,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:52,225 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:52,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:52,225 INFO L82 PathProgramCache]: Analyzing trace with hash -732575844, now seen corresponding path program 1 times [2019-09-10 06:59:52,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:52,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:52,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:52,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:52,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:52,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:52,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:59:52,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:52,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:59:52,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:59:52,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:59:52,307 INFO L87 Difference]: Start difference. First operand 107028 states and 153344 transitions. Second operand 6 states. [2019-09-10 06:59:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:53,089 INFO L93 Difference]: Finished difference Result 220482 states and 316478 transitions. [2019-09-10 06:59:53,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:59:53,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-09-10 06:59:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:53,388 INFO L225 Difference]: With dead ends: 220482 [2019-09-10 06:59:53,389 INFO L226 Difference]: Without dead ends: 220482 [2019-09-10 06:59:53,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:53,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220482 states. [2019-09-10 06:59:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220482 to 124265. [2019-09-10 06:59:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124265 states. [2019-09-10 06:59:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124265 states to 124265 states and 178433 transitions. [2019-09-10 06:59:55,556 INFO L78 Accepts]: Start accepts. Automaton has 124265 states and 178433 transitions. Word has length 75 [2019-09-10 06:59:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:55,556 INFO L475 AbstractCegarLoop]: Abstraction has 124265 states and 178433 transitions. [2019-09-10 06:59:55,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:59:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 124265 states and 178433 transitions. [2019-09-10 06:59:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:59:55,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:55,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:55,560 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash 979223403, now seen corresponding path program 1 times [2019-09-10 06:59:55,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:55,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:55,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:55,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:55,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:55,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:59:55,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:55,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:59:55,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:59:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:59:55,634 INFO L87 Difference]: Start difference. First operand 124265 states and 178433 transitions. Second operand 6 states. [2019-09-10 06:59:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:59:56,522 INFO L93 Difference]: Finished difference Result 230540 states and 331027 transitions. [2019-09-10 06:59:56,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:59:56,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 06:59:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:59:56,914 INFO L225 Difference]: With dead ends: 230540 [2019-09-10 06:59:56,914 INFO L226 Difference]: Without dead ends: 230540 [2019-09-10 06:59:56,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:59:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230540 states. [2019-09-10 06:59:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230540 to 140621. [2019-09-10 06:59:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140621 states. [2019-09-10 06:59:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140621 states to 140621 states and 202225 transitions. [2019-09-10 06:59:59,183 INFO L78 Accepts]: Start accepts. Automaton has 140621 states and 202225 transitions. Word has length 76 [2019-09-10 06:59:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:59:59,183 INFO L475 AbstractCegarLoop]: Abstraction has 140621 states and 202225 transitions. [2019-09-10 06:59:59,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:59:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 140621 states and 202225 transitions. [2019-09-10 06:59:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 06:59:59,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:59:59,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:59:59,187 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:59:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:59:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2142609195, now seen corresponding path program 1 times [2019-09-10 06:59:59,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:59:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:59:59,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:59:59,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:59:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:59:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:59:59,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:59:59,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:59:59,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:59:59,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:59:59,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:59:59,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:59:59,255 INFO L87 Difference]: Start difference. First operand 140621 states and 202225 transitions. Second operand 6 states. [2019-09-10 07:00:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:00,016 INFO L93 Difference]: Finished difference Result 241690 states and 347318 transitions. [2019-09-10 07:00:00,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:00:00,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-10 07:00:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:00,343 INFO L225 Difference]: With dead ends: 241690 [2019-09-10 07:00:00,343 INFO L226 Difference]: Without dead ends: 241690 [2019-09-10 07:00:00,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:00:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241690 states. [2019-09-10 07:00:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241690 to 156113. [2019-09-10 07:00:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156113 states. [2019-09-10 07:00:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156113 states to 156113 states and 224683 transitions. [2019-09-10 07:00:02,915 INFO L78 Accepts]: Start accepts. Automaton has 156113 states and 224683 transitions. Word has length 76 [2019-09-10 07:00:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:02,916 INFO L475 AbstractCegarLoop]: Abstraction has 156113 states and 224683 transitions. [2019-09-10 07:00:02,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:00:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 156113 states and 224683 transitions. [2019-09-10 07:00:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:00:02,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:02,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:02,920 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:02,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:02,920 INFO L82 PathProgramCache]: Analyzing trace with hash 279588177, now seen corresponding path program 1 times [2019-09-10 07:00:02,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:02,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:02,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:02,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:02,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:02,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:02,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:02,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:02,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:02,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:02,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:02,972 INFO L87 Difference]: Start difference. First operand 156113 states and 224683 transitions. Second operand 3 states. [2019-09-10 07:00:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:03,379 INFO L93 Difference]: Finished difference Result 180615 states and 254515 transitions. [2019-09-10 07:00:03,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:03,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:00:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:03,777 INFO L225 Difference]: With dead ends: 180615 [2019-09-10 07:00:03,778 INFO L226 Difference]: Without dead ends: 179399 [2019-09-10 07:00:03,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179399 states. [2019-09-10 07:00:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179399 to 159670. [2019-09-10 07:00:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159670 states. [2019-09-10 07:00:05,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159670 states to 159670 states and 226361 transitions. [2019-09-10 07:00:05,806 INFO L78 Accepts]: Start accepts. Automaton has 159670 states and 226361 transitions. Word has length 77 [2019-09-10 07:00:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:05,806 INFO L475 AbstractCegarLoop]: Abstraction has 159670 states and 226361 transitions. [2019-09-10 07:00:05,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 159670 states and 226361 transitions. [2019-09-10 07:00:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:00:05,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:05,811 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:05,811 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:05,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:05,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1413295307, now seen corresponding path program 1 times [2019-09-10 07:00:05,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:05,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:05,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:05,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:05,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:05,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:05,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:00:05,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:05,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:00:05,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:00:05,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:00:05,893 INFO L87 Difference]: Start difference. First operand 159670 states and 226361 transitions. Second operand 7 states. [2019-09-10 07:00:07,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:07,455 INFO L93 Difference]: Finished difference Result 485387 states and 675417 transitions. [2019-09-10 07:00:07,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:00:07,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-10 07:00:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:08,203 INFO L225 Difference]: With dead ends: 485387 [2019-09-10 07:00:08,203 INFO L226 Difference]: Without dead ends: 485387 [2019-09-10 07:00:08,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:00:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485387 states. [2019-09-10 07:00:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485387 to 159932. [2019-09-10 07:00:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159932 states. [2019-09-10 07:00:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159932 states to 159932 states and 226665 transitions. [2019-09-10 07:00:16,289 INFO L78 Accepts]: Start accepts. Automaton has 159932 states and 226665 transitions. Word has length 79 [2019-09-10 07:00:16,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:16,289 INFO L475 AbstractCegarLoop]: Abstraction has 159932 states and 226665 transitions. [2019-09-10 07:00:16,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:00:16,289 INFO L276 IsEmpty]: Start isEmpty. Operand 159932 states and 226665 transitions. [2019-09-10 07:00:16,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:00:16,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:16,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:16,294 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:16,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:16,294 INFO L82 PathProgramCache]: Analyzing trace with hash -633801153, now seen corresponding path program 1 times [2019-09-10 07:00:16,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:16,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:16,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:16,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:16,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:16,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:16,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:00:16,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:16,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:00:16,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:00:16,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:00:16,682 INFO L87 Difference]: Start difference. First operand 159932 states and 226665 transitions. Second operand 13 states. [2019-09-10 07:00:17,258 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:00:17,426 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:00:17,632 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 07:00:17,850 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 07:00:18,079 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 07:00:18,461 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 07:00:19,006 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-10 07:00:19,548 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-10 07:00:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:22,681 INFO L93 Difference]: Finished difference Result 880208 states and 1241098 transitions. [2019-09-10 07:00:22,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 07:00:22,681 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2019-09-10 07:00:22,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:23,928 INFO L225 Difference]: With dead ends: 880208 [2019-09-10 07:00:23,929 INFO L226 Difference]: Without dead ends: 880208 [2019-09-10 07:00:23,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:00:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880208 states. [2019-09-10 07:00:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880208 to 159867. [2019-09-10 07:00:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159867 states. [2019-09-10 07:00:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159867 states to 159867 states and 226579 transitions. [2019-09-10 07:00:35,387 INFO L78 Accepts]: Start accepts. Automaton has 159867 states and 226579 transitions. Word has length 80 [2019-09-10 07:00:35,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:35,388 INFO L475 AbstractCegarLoop]: Abstraction has 159867 states and 226579 transitions. [2019-09-10 07:00:35,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:00:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 159867 states and 226579 transitions. [2019-09-10 07:00:35,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:00:35,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:35,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:35,393 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:35,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:35,393 INFO L82 PathProgramCache]: Analyzing trace with hash -854675716, now seen corresponding path program 1 times [2019-09-10 07:00:35,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:35,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:35,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:35,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:35,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:35,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:35,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:00:35,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:35,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:00:35,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:00:35,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:00:35,861 INFO L87 Difference]: Start difference. First operand 159867 states and 226579 transitions. Second operand 13 states. [2019-09-10 07:00:36,299 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 07:00:36,451 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:00:36,604 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:00:36,769 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 07:00:37,364 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 07:00:40,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:40,467 INFO L93 Difference]: Finished difference Result 807208 states and 1140590 transitions. [2019-09-10 07:00:40,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 07:00:40,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2019-09-10 07:00:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:41,671 INFO L225 Difference]: With dead ends: 807208 [2019-09-10 07:00:41,672 INFO L226 Difference]: Without dead ends: 807208 [2019-09-10 07:00:41,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2019-09-10 07:00:42,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807208 states. [2019-09-10 07:00:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807208 to 157249. [2019-09-10 07:00:53,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157249 states. [2019-09-10 07:00:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157249 states to 157249 states and 222991 transitions. [2019-09-10 07:00:54,184 INFO L78 Accepts]: Start accepts. Automaton has 157249 states and 222991 transitions. Word has length 81 [2019-09-10 07:00:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:54,184 INFO L475 AbstractCegarLoop]: Abstraction has 157249 states and 222991 transitions. [2019-09-10 07:00:54,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:00:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 157249 states and 222991 transitions. [2019-09-10 07:00:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:00:54,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:54,189 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:54,189 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:54,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:54,190 INFO L82 PathProgramCache]: Analyzing trace with hash -126466479, now seen corresponding path program 1 times [2019-09-10 07:00:54,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:54,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:54,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:54,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:54,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:54,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:54,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:54,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:54,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:54,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:54,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:54,225 INFO L87 Difference]: Start difference. First operand 157249 states and 222991 transitions. Second operand 3 states. [2019-09-10 07:00:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:54,808 INFO L93 Difference]: Finished difference Result 245867 states and 347843 transitions. [2019-09-10 07:00:54,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:54,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:00:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:55,111 INFO L225 Difference]: With dead ends: 245867 [2019-09-10 07:00:55,111 INFO L226 Difference]: Without dead ends: 245867 [2019-09-10 07:00:55,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245867 states. [2019-09-10 07:00:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245867 to 193835. [2019-09-10 07:00:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193835 states. [2019-09-10 07:00:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193835 states to 193835 states and 275086 transitions. [2019-09-10 07:00:57,790 INFO L78 Accepts]: Start accepts. Automaton has 193835 states and 275086 transitions. Word has length 81 [2019-09-10 07:00:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:00:57,790 INFO L475 AbstractCegarLoop]: Abstraction has 193835 states and 275086 transitions. [2019-09-10 07:00:57,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:00:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 193835 states and 275086 transitions. [2019-09-10 07:00:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:00:57,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:00:57,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:00:57,795 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:00:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:00:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash -447058254, now seen corresponding path program 1 times [2019-09-10 07:00:57,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:00:57,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:57,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:00:57,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:00:57,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:00:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:00:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:00:57,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:00:57,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:00:57,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:00:57,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:00:57,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:00:57,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:00:57,841 INFO L87 Difference]: Start difference. First operand 193835 states and 275086 transitions. Second operand 3 states. [2019-09-10 07:00:59,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:00:59,438 INFO L93 Difference]: Finished difference Result 288083 states and 408853 transitions. [2019-09-10 07:00:59,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:00:59,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:00:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:00:59,856 INFO L225 Difference]: With dead ends: 288083 [2019-09-10 07:00:59,857 INFO L226 Difference]: Without dead ends: 288083 [2019-09-10 07:00:59,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:00,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288083 states. [2019-09-10 07:01:05,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288083 to 180689. [2019-09-10 07:01:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180689 states. [2019-09-10 07:01:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180689 states to 180689 states and 256386 transitions. [2019-09-10 07:01:05,598 INFO L78 Accepts]: Start accepts. Automaton has 180689 states and 256386 transitions. Word has length 82 [2019-09-10 07:01:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:05,598 INFO L475 AbstractCegarLoop]: Abstraction has 180689 states and 256386 transitions. [2019-09-10 07:01:05,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 180689 states and 256386 transitions. [2019-09-10 07:01:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:01:05,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:05,604 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:05,604 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:05,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1127924530, now seen corresponding path program 1 times [2019-09-10 07:01:05,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:05,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:05,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:05,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:05,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:05,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:05,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:05,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:05,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:05,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:05,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:05,651 INFO L87 Difference]: Start difference. First operand 180689 states and 256386 transitions. Second operand 3 states. [2019-09-10 07:01:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:06,183 INFO L93 Difference]: Finished difference Result 172861 states and 242050 transitions. [2019-09-10 07:01:06,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:06,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:01:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:06,378 INFO L225 Difference]: With dead ends: 172861 [2019-09-10 07:01:06,378 INFO L226 Difference]: Without dead ends: 172861 [2019-09-10 07:01:06,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:06,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172861 states. [2019-09-10 07:01:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172861 to 172859. [2019-09-10 07:01:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172859 states. [2019-09-10 07:01:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172859 states to 172859 states and 242049 transitions. [2019-09-10 07:01:08,428 INFO L78 Accepts]: Start accepts. Automaton has 172859 states and 242049 transitions. Word has length 84 [2019-09-10 07:01:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:08,428 INFO L475 AbstractCegarLoop]: Abstraction has 172859 states and 242049 transitions. [2019-09-10 07:01:08,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 172859 states and 242049 transitions. [2019-09-10 07:01:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:01:08,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:08,434 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:08,434 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:08,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:08,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1788091283, now seen corresponding path program 1 times [2019-09-10 07:01:08,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:08,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:08,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:08,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:08,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:08,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:08,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:08,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:08,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:08,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:08,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:08,479 INFO L87 Difference]: Start difference. First operand 172859 states and 242049 transitions. Second operand 3 states. [2019-09-10 07:01:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:08,969 INFO L93 Difference]: Finished difference Result 164029 states and 226699 transitions. [2019-09-10 07:01:08,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:08,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-10 07:01:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:09,145 INFO L225 Difference]: With dead ends: 164029 [2019-09-10 07:01:09,145 INFO L226 Difference]: Without dead ends: 164029 [2019-09-10 07:01:09,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164029 states. [2019-09-10 07:01:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164029 to 164027. [2019-09-10 07:01:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164027 states. [2019-09-10 07:01:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164027 states to 164027 states and 226698 transitions. [2019-09-10 07:01:11,440 INFO L78 Accepts]: Start accepts. Automaton has 164027 states and 226698 transitions. Word has length 85 [2019-09-10 07:01:11,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:11,440 INFO L475 AbstractCegarLoop]: Abstraction has 164027 states and 226698 transitions. [2019-09-10 07:01:11,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 164027 states and 226698 transitions. [2019-09-10 07:01:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:01:11,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:11,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:11,447 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:11,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:11,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1511167802, now seen corresponding path program 1 times [2019-09-10 07:01:11,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:11,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:11,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:11,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:11,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:11,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:11,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:11,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:11,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:11,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:11,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:11,482 INFO L87 Difference]: Start difference. First operand 164027 states and 226698 transitions. Second operand 3 states. [2019-09-10 07:01:12,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:12,090 INFO L93 Difference]: Finished difference Result 256712 states and 354137 transitions. [2019-09-10 07:01:12,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:12,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:01:12,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:12,423 INFO L225 Difference]: With dead ends: 256712 [2019-09-10 07:01:12,424 INFO L226 Difference]: Without dead ends: 256712 [2019-09-10 07:01:12,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256712 states. [2019-09-10 07:01:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256712 to 163821. [2019-09-10 07:01:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163821 states. [2019-09-10 07:01:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163821 states to 163821 states and 225964 transitions. [2019-09-10 07:01:14,828 INFO L78 Accepts]: Start accepts. Automaton has 163821 states and 225964 transitions. Word has length 86 [2019-09-10 07:01:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:14,828 INFO L475 AbstractCegarLoop]: Abstraction has 163821 states and 225964 transitions. [2019-09-10 07:01:14,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 163821 states and 225964 transitions. [2019-09-10 07:01:14,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:01:14,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:14,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:14,833 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:14,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:14,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1969639764, now seen corresponding path program 1 times [2019-09-10 07:01:14,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:14,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:14,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:14,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:14,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:18,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:18,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:01:18,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:18,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:01:18,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:01:18,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:01:18,760 INFO L87 Difference]: Start difference. First operand 163821 states and 225964 transitions. Second operand 18 states. [2019-09-10 07:01:19,416 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 07:01:19,760 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-09-10 07:01:20,118 WARN L188 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 99 [2019-09-10 07:01:20,311 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-09-10 07:01:20,501 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-10 07:01:20,997 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 07:01:21,200 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 07:01:21,407 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-10 07:01:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:23,806 INFO L93 Difference]: Finished difference Result 410709 states and 567235 transitions. [2019-09-10 07:01:23,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 07:01:23,807 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2019-09-10 07:01:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:24,902 INFO L225 Difference]: With dead ends: 410709 [2019-09-10 07:01:24,902 INFO L226 Difference]: Without dead ends: 410709 [2019-09-10 07:01:24,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=272, Invalid=1134, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 07:01:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410709 states. [2019-09-10 07:01:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410709 to 163807. [2019-09-10 07:01:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163807 states. [2019-09-10 07:01:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163807 states to 163807 states and 225946 transitions. [2019-09-10 07:01:27,674 INFO L78 Accepts]: Start accepts. Automaton has 163807 states and 225946 transitions. Word has length 86 [2019-09-10 07:01:27,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:27,674 INFO L475 AbstractCegarLoop]: Abstraction has 163807 states and 225946 transitions. [2019-09-10 07:01:27,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:01:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 163807 states and 225946 transitions. [2019-09-10 07:01:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:01:27,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:27,679 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:01:27,679 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:27,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:27,679 INFO L82 PathProgramCache]: Analyzing trace with hash 539043914, now seen corresponding path program 1 times [2019-09-10 07:01:27,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:27,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:27,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:27,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:27,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:28,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:28,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:01:28,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:28,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:01:28,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:01:28,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:01:28,574 INFO L87 Difference]: Start difference. First operand 163807 states and 225946 transitions. Second operand 18 states. [2019-09-10 07:01:29,278 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-09-10 07:01:29,486 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-10 07:01:30,104 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 07:01:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:34,534 INFO L93 Difference]: Finished difference Result 640035 states and 884372 transitions. [2019-09-10 07:01:34,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 07:01:34,534 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-09-10 07:01:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:35,432 INFO L225 Difference]: With dead ends: 640035 [2019-09-10 07:01:35,432 INFO L226 Difference]: Without dead ends: 640035 [2019-09-10 07:01:35,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 07:01:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640035 states. [2019-09-10 07:01:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640035 to 163817. [2019-09-10 07:01:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163817 states. [2019-09-10 07:01:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163817 states to 163817 states and 225954 transitions. [2019-09-10 07:01:44,182 INFO L78 Accepts]: Start accepts. Automaton has 163817 states and 225954 transitions. Word has length 87 [2019-09-10 07:01:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:44,183 INFO L475 AbstractCegarLoop]: Abstraction has 163817 states and 225954 transitions. [2019-09-10 07:01:44,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:01:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 163817 states and 225954 transitions. [2019-09-10 07:01:44,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 07:01:44,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:44,195 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:01:44,195 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:44,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:44,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2107308954, now seen corresponding path program 1 times [2019-09-10 07:01:44,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:44,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:44,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:44,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:44,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:44,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:44,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:44,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:01:44,242 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:44,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:01:44,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:01:44,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:44,243 INFO L87 Difference]: Start difference. First operand 163817 states and 225954 transitions. Second operand 3 states. [2019-09-10 07:01:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:44,850 INFO L93 Difference]: Finished difference Result 262101 states and 359036 transitions. [2019-09-10 07:01:44,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:01:44,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 07:01:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:45,155 INFO L225 Difference]: With dead ends: 262101 [2019-09-10 07:01:45,155 INFO L226 Difference]: Without dead ends: 262101 [2019-09-10 07:01:45,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:01:45,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262101 states. [2019-09-10 07:01:47,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262101 to 252007. [2019-09-10 07:01:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252007 states. [2019-09-10 07:01:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252007 states to 252007 states and 347540 transitions. [2019-09-10 07:01:47,968 INFO L78 Accepts]: Start accepts. Automaton has 252007 states and 347540 transitions. Word has length 94 [2019-09-10 07:01:47,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:01:47,968 INFO L475 AbstractCegarLoop]: Abstraction has 252007 states and 347540 transitions. [2019-09-10 07:01:47,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:01:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 252007 states and 347540 transitions. [2019-09-10 07:01:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 07:01:47,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:01:47,977 INFO L399 BasicCegarLoop]: trace histogram [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 07:01:47,977 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:01:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:01:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash -728825680, now seen corresponding path program 1 times [2019-09-10 07:01:47,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:01:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:47,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:01:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:01:47,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:01:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:01:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:01:48,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:01:48,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:01:48,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:01:48,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:01:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:01:48,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:01:48,029 INFO L87 Difference]: Start difference. First operand 252007 states and 347540 transitions. Second operand 5 states. [2019-09-10 07:01:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:01:51,438 INFO L93 Difference]: Finished difference Result 904203 states and 1222189 transitions. [2019-09-10 07:01:51,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:01:51,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 07:01:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:01:52,769 INFO L225 Difference]: With dead ends: 904203 [2019-09-10 07:01:52,770 INFO L226 Difference]: Without dead ends: 904203 [2019-09-10 07:01:52,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:01:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904203 states. [2019-09-10 07:02:06,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904203 to 495189. [2019-09-10 07:02:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495189 states. [2019-09-10 07:02:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495189 states to 495189 states and 679093 transitions. [2019-09-10 07:02:06,840 INFO L78 Accepts]: Start accepts. Automaton has 495189 states and 679093 transitions. Word has length 98 [2019-09-10 07:02:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:06,840 INFO L475 AbstractCegarLoop]: Abstraction has 495189 states and 679093 transitions. [2019-09-10 07:02:06,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:02:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 495189 states and 679093 transitions. [2019-09-10 07:02:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 07:02:06,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:06,851 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:02:06,851 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:06,852 INFO L82 PathProgramCache]: Analyzing trace with hash -893102038, now seen corresponding path program 1 times [2019-09-10 07:02:06,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:06,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:06,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:06,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:06,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:06,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:06,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:02:06,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:06,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:02:06,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:02:06,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:02:06,901 INFO L87 Difference]: Start difference. First operand 495189 states and 679093 transitions. Second operand 5 states. [2019-09-10 07:02:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:09,924 INFO L93 Difference]: Finished difference Result 534732 states and 712826 transitions. [2019-09-10 07:02:09,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:02:09,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 07:02:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:10,632 INFO L225 Difference]: With dead ends: 534732 [2019-09-10 07:02:10,633 INFO L226 Difference]: Without dead ends: 534732 [2019-09-10 07:02:10,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534732 states. [2019-09-10 07:02:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534732 to 376155. [2019-09-10 07:02:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376155 states. [2019-09-10 07:02:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376155 states to 376155 states and 505905 transitions. [2019-09-10 07:02:23,074 INFO L78 Accepts]: Start accepts. Automaton has 376155 states and 505905 transitions. Word has length 99 [2019-09-10 07:02:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:23,075 INFO L475 AbstractCegarLoop]: Abstraction has 376155 states and 505905 transitions. [2019-09-10 07:02:23,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:02:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 376155 states and 505905 transitions. [2019-09-10 07:02:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:02:23,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:23,092 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:02:23,092 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:23,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2040123546, now seen corresponding path program 1 times [2019-09-10 07:02:23,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:23,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:23,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:23,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:23,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:02:23,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:23,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:02:23,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:23,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:02:23,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:02:23,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:02:23,146 INFO L87 Difference]: Start difference. First operand 376155 states and 505905 transitions. Second operand 5 states. [2019-09-10 07:02:31,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:02:31,522 INFO L93 Difference]: Finished difference Result 1163650 states and 1534801 transitions. [2019-09-10 07:02:31,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:02:31,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 07:02:31,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:02:34,128 INFO L225 Difference]: With dead ends: 1163650 [2019-09-10 07:02:34,128 INFO L226 Difference]: Without dead ends: 1163650 [2019-09-10 07:02:34,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:02:34,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163650 states. [2019-09-10 07:02:52,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163650 to 704627. [2019-09-10 07:02:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704627 states. [2019-09-10 07:02:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704627 states to 704627 states and 944960 transitions. [2019-09-10 07:02:53,706 INFO L78 Accepts]: Start accepts. Automaton has 704627 states and 944960 transitions. Word has length 106 [2019-09-10 07:02:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:02:53,707 INFO L475 AbstractCegarLoop]: Abstraction has 704627 states and 944960 transitions. [2019-09-10 07:02:53,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:02:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 704627 states and 944960 transitions. [2019-09-10 07:02:53,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 07:02:53,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:02:53,755 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-10 07:02:53,755 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:02:53,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:02:53,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1006385163, now seen corresponding path program 1 times [2019-09-10 07:02:53,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:02:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:53,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:02:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:02:53,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:02:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:02:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 07:02:53,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:02:53,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:02:53,816 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:02:53,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:02:53,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:02:53,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:02:53,817 INFO L87 Difference]: Start difference. First operand 704627 states and 944960 transitions. Second operand 3 states. [2019-09-10 07:03:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:02,079 INFO L93 Difference]: Finished difference Result 713121 states and 936070 transitions. [2019-09-10 07:03:02,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:02,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-10 07:03:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:03,883 INFO L225 Difference]: With dead ends: 713121 [2019-09-10 07:03:03,883 INFO L226 Difference]: Without dead ends: 713121 [2019-09-10 07:03:03,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713121 states. [2019-09-10 07:03:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713121 to 543610. [2019-09-10 07:03:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543610 states. [2019-09-10 07:03:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543610 states to 543610 states and 715895 transitions. [2019-09-10 07:03:12,863 INFO L78 Accepts]: Start accepts. Automaton has 543610 states and 715895 transitions. Word has length 114 [2019-09-10 07:03:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:12,864 INFO L475 AbstractCegarLoop]: Abstraction has 543610 states and 715895 transitions. [2019-09-10 07:03:12,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 543610 states and 715895 transitions. [2019-09-10 07:03:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 07:03:12,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:12,891 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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 07:03:12,891 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:12,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1062384031, now seen corresponding path program 1 times [2019-09-10 07:03:12,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:12,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:12,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:12,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:12,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:12,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:12,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:12,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:12,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:12,937 INFO L87 Difference]: Start difference. First operand 543610 states and 715895 transitions. Second operand 3 states. [2019-09-10 07:03:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:21,830 INFO L93 Difference]: Finished difference Result 1031033 states and 1335084 transitions. [2019-09-10 07:03:21,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:21,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 07:03:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:03:23,453 INFO L225 Difference]: With dead ends: 1031033 [2019-09-10 07:03:23,453 INFO L226 Difference]: Without dead ends: 1020469 [2019-09-10 07:03:23,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:24,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020469 states. [2019-09-10 07:03:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020469 to 907675. [2019-09-10 07:03:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907675 states. [2019-09-10 07:03:50,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907675 states to 907675 states and 1187861 transitions. [2019-09-10 07:03:50,596 INFO L78 Accepts]: Start accepts. Automaton has 907675 states and 1187861 transitions. Word has length 115 [2019-09-10 07:03:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:03:50,597 INFO L475 AbstractCegarLoop]: Abstraction has 907675 states and 1187861 transitions. [2019-09-10 07:03:50,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:03:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 907675 states and 1187861 transitions. [2019-09-10 07:03:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:03:50,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:03:50,617 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-10 07:03:50,617 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:03:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:03:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1866222322, now seen corresponding path program 1 times [2019-09-10 07:03:50,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:03:50,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:50,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:03:50,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:03:50,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:03:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:03:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:03:50,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:03:50,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:03:50,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:03:50,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:03:50,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:03:50,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:03:50,666 INFO L87 Difference]: Start difference. First operand 907675 states and 1187861 transitions. Second operand 3 states. [2019-09-10 07:03:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:03:55,235 INFO L93 Difference]: Finished difference Result 1147045 states and 1468275 transitions. [2019-09-10 07:03:55,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:03:55,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:03:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:04:08,568 INFO L225 Difference]: With dead ends: 1147045 [2019-09-10 07:04:08,569 INFO L226 Difference]: Without dead ends: 1147045 [2019-09-10 07:04:08,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:04:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147045 states. [2019-09-10 07:04:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147045 to 1073941. [2019-09-10 07:04:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073941 states. [2019-09-10 07:04:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073941 states to 1073941 states and 1387183 transitions. [2019-09-10 07:04:35,314 INFO L78 Accepts]: Start accepts. Automaton has 1073941 states and 1387183 transitions. Word has length 116 [2019-09-10 07:04:35,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:04:35,314 INFO L475 AbstractCegarLoop]: Abstraction has 1073941 states and 1387183 transitions. [2019-09-10 07:04:35,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:04:35,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1073941 states and 1387183 transitions. [2019-09-10 07:04:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 07:04:35,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:04:35,331 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:04:35,331 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:04:35,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:35,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1977600483, now seen corresponding path program 1 times [2019-09-10 07:04:35,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:04:35,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:35,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:35,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:04:35,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:04:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:35,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:04:35,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:04:35,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2019-09-10 07:04:35,549 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [79], [92], [96], [99], [102], [105], [107], [109], [113], [126], [130], [143], [146], [149], [153], [156], [160], [171], [174], [185], [188], [191], [199], [202], [213], [215], [218], [221], [223], [226], [227], [229], [232], [237], [248], [250], [253], [264], [266], [269], [280], [282], [285], [296], [308], [310], [323], [331], [350], [361], [363], [376], [384], [403], [414], [416], [419], [422], [425], [427], [429], [467], [469], [471], [484], [492], [494], [499], [512], [522], [536], [548], [556], [572], [577], [593], [619], [647], [648], [652], [653], [654] [2019-09-10 07:04:35,586 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:04:35,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:04:35,732 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:04:36,316 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:04:36,319 INFO L272 AbstractInterpreter]: Visited 108 different actions 482 times. Merged at 43 different actions 326 times. Widened at 15 different actions 43 times. Performed 1541 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1541 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 53 fixpoints after 13 different actions. Largest state had 132 variables. [2019-09-10 07:04:36,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:04:36,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:04:36,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:04:36,325 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 07:04:36,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:04:36,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:04:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:04:36,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 07:04:36,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:04:36,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:04:36,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:04:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:37,739 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:04:38,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:04:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:04:38,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:04:38,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2019-09-10 07:04:38,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:04:38,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 07:04:38,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 07:04:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-09-10 07:04:38,109 INFO L87 Difference]: Start difference. First operand 1073941 states and 1387183 transitions. Second operand 19 states. [2019-09-10 07:04:38,468 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:04:38,640 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:04:39,912 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-09-10 07:04:40,539 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 07:04:41,382 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 07:04:41,516 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-10 07:04:41,824 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-10 07:04:43,930 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:04:45,538 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-10 07:04:46,119 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-10 07:05:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:05:15,719 INFO L93 Difference]: Finished difference Result 3730073 states and 4754113 transitions. [2019-09-10 07:05:15,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 07:05:15,720 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 119 [2019-09-10 07:05:15,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:05:23,569 INFO L225 Difference]: With dead ends: 3730073 [2019-09-10 07:05:23,569 INFO L226 Difference]: Without dead ends: 3729128 [2019-09-10 07:05:23,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 211 SyntacticMatches, 14 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=816, Invalid=2966, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 07:05:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729128 states.