java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:43:12,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:43:12,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:43:12,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:43:12,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:43:12,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:43:12,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:43:12,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:43:12,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:43:12,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:43:12,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:43:12,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:43:12,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:43:12,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:43:12,690 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:43:12,691 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:43:12,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:43:12,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:43:12,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:43:12,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:43:12,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:43:12,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:43:12,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:43:12,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:43:12,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:43:12,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:43:12,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:43:12,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:43:12,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:43:12,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:43:12,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:43:12,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:43:12,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:43:12,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:43:12,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:43:12,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:43:12,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:43:12,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:43:12,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:43:12,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:43:12,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:43:12,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 08:43:12,730 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:43:12,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:43:12,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:43:12,733 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:43:12,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:43:12,734 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:43:12,734 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:43:12,735 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:43:12,735 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:43:12,735 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:43:12,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:43:12,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:43:12,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:43:12,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:43:12,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:43:12,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:43:12,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:43:12,737 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:43:12,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:43:12,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:43:12,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:43:12,739 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:43:12,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:43:12,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:43:12,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:43:12,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:43:12,740 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:43:12,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:43:12,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:43:12,741 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:43:12,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:43:12,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:43:12,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:43:12,795 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:43:12,795 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:43:12,796 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:43:12,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526325fef/3ab2da8324af4be7b0d03c8ae0d04c59/FLAG2e0e4a8e1 [2019-09-10 08:43:13,400 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:43:13,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:43:13,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526325fef/3ab2da8324af4be7b0d03c8ae0d04c59/FLAG2e0e4a8e1 [2019-09-10 08:43:13,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526325fef/3ab2da8324af4be7b0d03c8ae0d04c59 [2019-09-10 08:43:13,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:43:13,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:43:13,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:43:13,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:43:13,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:43:13,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:43:13" (1/1) ... [2019-09-10 08:43:13,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3708097c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:13, skipping insertion in model container [2019-09-10 08:43:13,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:43:13" (1/1) ... [2019-09-10 08:43:13,710 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:43:13,765 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:43:14,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:43:14,181 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:43:14,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:43:14,288 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:43:14,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:14 WrapperNode [2019-09-10 08:43:14,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:43:14,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:43:14,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:43:14,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:43:14,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:14" (1/1) ... [2019-09-10 08:43:14,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:14" (1/1) ... [2019-09-10 08:43:14,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:14" (1/1) ... [2019-09-10 08:43:14,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:14" (1/1) ... [2019-09-10 08:43:14,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:14" (1/1) ... [2019-09-10 08:43:14,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:14" (1/1) ... [2019-09-10 08:43:14,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:14" (1/1) ... [2019-09-10 08:43:14,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:43:14,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:43:14,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:43:14,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:43:14,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:43:14,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:43:14,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:43:14,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:43:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:43:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:43:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:43:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:43:14,420 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:43:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:43:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:43:14,421 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:43:14,422 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:43:14,422 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:43:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:43:14,424 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:43:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:43:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:43:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:43:14,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:43:15,319 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:43:15,319 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:43:15,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:43:15 BoogieIcfgContainer [2019-09-10 08:43:15,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:43:15,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:43:15,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:43:15,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:43:15,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:43:13" (1/3) ... [2019-09-10 08:43:15,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244ba18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:43:15, skipping insertion in model container [2019-09-10 08:43:15,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:43:14" (2/3) ... [2019-09-10 08:43:15,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244ba18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:43:15, skipping insertion in model container [2019-09-10 08:43:15,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:43:15" (3/3) ... [2019-09-10 08:43:15,333 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 08:43:15,343 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:43:15,369 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:43:15,388 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:43:15,428 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:43:15,429 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:43:15,429 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:43:15,429 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:43:15,430 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:43:15,430 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:43:15,430 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:43:15,430 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:43:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-09-10 08:43:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 08:43:15,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:15,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:15,491 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:15,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:15,497 INFO L82 PathProgramCache]: Analyzing trace with hash 170153311, now seen corresponding path program 1 times [2019-09-10 08:43:15,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:15,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:15,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:15,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:15,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:15,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:15,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:15,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:15,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:16,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:16,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:16,010 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 3 states. [2019-09-10 08:43:16,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:16,142 INFO L93 Difference]: Finished difference Result 237 states and 388 transitions. [2019-09-10 08:43:16,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:16,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 08:43:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:16,161 INFO L225 Difference]: With dead ends: 237 [2019-09-10 08:43:16,161 INFO L226 Difference]: Without dead ends: 229 [2019-09-10 08:43:16,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-10 08:43:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-09-10 08:43:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-10 08:43:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 349 transitions. [2019-09-10 08:43:16,224 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 349 transitions. Word has length 66 [2019-09-10 08:43:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:16,225 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 349 transitions. [2019-09-10 08:43:16,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 349 transitions. [2019-09-10 08:43:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 08:43:16,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:16,230 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:16,230 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:16,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash -340326208, now seen corresponding path program 1 times [2019-09-10 08:43:16,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:16,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:16,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:16,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:16,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:16,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:16,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:16,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:16,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:16,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:16,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:16,390 INFO L87 Difference]: Start difference. First operand 226 states and 349 transitions. Second operand 3 states. [2019-09-10 08:43:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:16,429 INFO L93 Difference]: Finished difference Result 375 states and 587 transitions. [2019-09-10 08:43:16,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:16,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 08:43:16,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:16,433 INFO L225 Difference]: With dead ends: 375 [2019-09-10 08:43:16,434 INFO L226 Difference]: Without dead ends: 375 [2019-09-10 08:43:16,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-10 08:43:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2019-09-10 08:43:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-09-10 08:43:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 584 transitions. [2019-09-10 08:43:16,479 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 584 transitions. Word has length 68 [2019-09-10 08:43:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:16,480 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 584 transitions. [2019-09-10 08:43:16,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 584 transitions. [2019-09-10 08:43:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 08:43:16,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:16,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:16,485 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:16,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1584902111, now seen corresponding path program 1 times [2019-09-10 08:43:16,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:16,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:16,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:16,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:16,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:16,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:16,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:16,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:16,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:16,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:16,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:16,599 INFO L87 Difference]: Start difference. First operand 371 states and 584 transitions. Second operand 3 states. [2019-09-10 08:43:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:16,653 INFO L93 Difference]: Finished difference Result 649 states and 1025 transitions. [2019-09-10 08:43:16,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:16,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 08:43:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:16,661 INFO L225 Difference]: With dead ends: 649 [2019-09-10 08:43:16,662 INFO L226 Difference]: Without dead ends: 649 [2019-09-10 08:43:16,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-09-10 08:43:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 643. [2019-09-10 08:43:16,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-10 08:43:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1020 transitions. [2019-09-10 08:43:16,703 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1020 transitions. Word has length 70 [2019-09-10 08:43:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:16,704 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1020 transitions. [2019-09-10 08:43:16,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1020 transitions. [2019-09-10 08:43:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 08:43:16,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:16,717 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:16,718 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:16,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:16,718 INFO L82 PathProgramCache]: Analyzing trace with hash 834475330, now seen corresponding path program 1 times [2019-09-10 08:43:16,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:16,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:16,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:16,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:16,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:16,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:16,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:43:16,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:16,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:43:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:43:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:16,949 INFO L87 Difference]: Start difference. First operand 643 states and 1020 transitions. Second operand 5 states. [2019-09-10 08:43:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:17,207 INFO L93 Difference]: Finished difference Result 2705 states and 4347 transitions. [2019-09-10 08:43:17,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:43:17,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 08:43:17,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:17,222 INFO L225 Difference]: With dead ends: 2705 [2019-09-10 08:43:17,223 INFO L226 Difference]: Without dead ends: 2705 [2019-09-10 08:43:17,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:43:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2019-09-10 08:43:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 1207. [2019-09-10 08:43:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2019-09-10 08:43:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1928 transitions. [2019-09-10 08:43:17,267 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1928 transitions. Word has length 72 [2019-09-10 08:43:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:17,268 INFO L475 AbstractCegarLoop]: Abstraction has 1207 states and 1928 transitions. [2019-09-10 08:43:17,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:43:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1928 transitions. [2019-09-10 08:43:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 08:43:17,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:17,270 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:17,271 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:17,271 INFO L82 PathProgramCache]: Analyzing trace with hash 37321009, now seen corresponding path program 1 times [2019-09-10 08:43:17,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:17,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:17,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:17,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:17,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:17,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:17,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:43:17,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:17,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:17,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:17,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:17,367 INFO L87 Difference]: Start difference. First operand 1207 states and 1928 transitions. Second operand 4 states. [2019-09-10 08:43:17,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:17,452 INFO L93 Difference]: Finished difference Result 3253 states and 5220 transitions. [2019-09-10 08:43:17,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:43:17,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-10 08:43:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:17,470 INFO L225 Difference]: With dead ends: 3253 [2019-09-10 08:43:17,470 INFO L226 Difference]: Without dead ends: 3253 [2019-09-10 08:43:17,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3253 states. [2019-09-10 08:43:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3253 to 2221. [2019-09-10 08:43:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2221 states. [2019-09-10 08:43:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3552 transitions. [2019-09-10 08:43:17,533 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3552 transitions. Word has length 73 [2019-09-10 08:43:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:17,534 INFO L475 AbstractCegarLoop]: Abstraction has 2221 states and 3552 transitions. [2019-09-10 08:43:17,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:43:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3552 transitions. [2019-09-10 08:43:17,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 08:43:17,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:17,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:17,537 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:17,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:17,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1099898857, now seen corresponding path program 1 times [2019-09-10 08:43:17,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:17,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:17,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:17,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:17,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:17,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:17,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:43:17,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:17,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:43:17,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:43:17,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:43:17,664 INFO L87 Difference]: Start difference. First operand 2221 states and 3552 transitions. Second operand 7 states. [2019-09-10 08:43:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:17,976 INFO L93 Difference]: Finished difference Result 8002 states and 12770 transitions. [2019-09-10 08:43:17,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:43:17,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-10 08:43:17,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:18,019 INFO L225 Difference]: With dead ends: 8002 [2019-09-10 08:43:18,019 INFO L226 Difference]: Without dead ends: 8002 [2019-09-10 08:43:18,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:43:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8002 states. [2019-09-10 08:43:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8002 to 7843. [2019-09-10 08:43:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7843 states. [2019-09-10 08:43:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7843 states to 7843 states and 12533 transitions. [2019-09-10 08:43:18,244 INFO L78 Accepts]: Start accepts. Automaton has 7843 states and 12533 transitions. Word has length 74 [2019-09-10 08:43:18,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:18,245 INFO L475 AbstractCegarLoop]: Abstraction has 7843 states and 12533 transitions. [2019-09-10 08:43:18,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:43:18,245 INFO L276 IsEmpty]: Start isEmpty. Operand 7843 states and 12533 transitions. [2019-09-10 08:43:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 08:43:18,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:18,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:18,252 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:18,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:18,260 INFO L82 PathProgramCache]: Analyzing trace with hash -315368200, now seen corresponding path program 1 times [2019-09-10 08:43:18,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:18,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:18,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:18,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:18,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:18,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:18,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:43:18,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:18,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:18,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:18,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:18,378 INFO L87 Difference]: Start difference. First operand 7843 states and 12533 transitions. Second operand 4 states. [2019-09-10 08:43:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:18,687 INFO L93 Difference]: Finished difference Result 15873 states and 25447 transitions. [2019-09-10 08:43:18,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:43:18,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-10 08:43:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:18,798 INFO L225 Difference]: With dead ends: 15873 [2019-09-10 08:43:18,799 INFO L226 Difference]: Without dead ends: 15873 [2019-09-10 08:43:18,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15873 states. [2019-09-10 08:43:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15873 to 11256. [2019-09-10 08:43:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11256 states. [2019-09-10 08:43:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11256 states to 11256 states and 17984 transitions. [2019-09-10 08:43:19,169 INFO L78 Accepts]: Start accepts. Automaton has 11256 states and 17984 transitions. Word has length 75 [2019-09-10 08:43:19,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:19,169 INFO L475 AbstractCegarLoop]: Abstraction has 11256 states and 17984 transitions. [2019-09-10 08:43:19,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:43:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 11256 states and 17984 transitions. [2019-09-10 08:43:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:43:19,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:19,173 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 08:43:19,173 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:19,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1281911695, now seen corresponding path program 1 times [2019-09-10 08:43:19,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:19,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:19,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:19,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:19,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:19,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:19,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:19,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:19,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:19,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:19,250 INFO L87 Difference]: Start difference. First operand 11256 states and 17984 transitions. Second operand 3 states. [2019-09-10 08:43:19,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:19,343 INFO L93 Difference]: Finished difference Result 15402 states and 24646 transitions. [2019-09-10 08:43:19,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:19,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 08:43:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:19,384 INFO L225 Difference]: With dead ends: 15402 [2019-09-10 08:43:19,384 INFO L226 Difference]: Without dead ends: 15402 [2019-09-10 08:43:19,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15402 states. [2019-09-10 08:43:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15402 to 15400. [2019-09-10 08:43:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15400 states. [2019-09-10 08:43:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15400 states to 15400 states and 24645 transitions. [2019-09-10 08:43:19,750 INFO L78 Accepts]: Start accepts. Automaton has 15400 states and 24645 transitions. Word has length 76 [2019-09-10 08:43:19,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:19,750 INFO L475 AbstractCegarLoop]: Abstraction has 15400 states and 24645 transitions. [2019-09-10 08:43:19,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 15400 states and 24645 transitions. [2019-09-10 08:43:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:43:19,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:19,752 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 08:43:19,753 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:19,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:19,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1289808927, now seen corresponding path program 1 times [2019-09-10 08:43:19,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:19,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:19,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:19,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:19,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:19,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:19,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:19,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:19,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:19,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:19,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:19,813 INFO L87 Difference]: Start difference. First operand 15400 states and 24645 transitions. Second operand 3 states. [2019-09-10 08:43:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:19,909 INFO L93 Difference]: Finished difference Result 22765 states and 36136 transitions. [2019-09-10 08:43:19,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:19,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 08:43:19,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:19,969 INFO L225 Difference]: With dead ends: 22765 [2019-09-10 08:43:19,969 INFO L226 Difference]: Without dead ends: 22765 [2019-09-10 08:43:19,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:20,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22765 states. [2019-09-10 08:43:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22765 to 22763. [2019-09-10 08:43:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22763 states. [2019-09-10 08:43:20,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22763 states to 22763 states and 36135 transitions. [2019-09-10 08:43:20,869 INFO L78 Accepts]: Start accepts. Automaton has 22763 states and 36135 transitions. Word has length 76 [2019-09-10 08:43:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:20,869 INFO L475 AbstractCegarLoop]: Abstraction has 22763 states and 36135 transitions. [2019-09-10 08:43:20,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:20,869 INFO L276 IsEmpty]: Start isEmpty. Operand 22763 states and 36135 transitions. [2019-09-10 08:43:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:43:20,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:20,871 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 08:43:20,872 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:20,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:20,872 INFO L82 PathProgramCache]: Analyzing trace with hash -645952435, now seen corresponding path program 1 times [2019-09-10 08:43:20,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:20,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:20,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:20,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:20,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:20,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:20,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:20,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:20,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:20,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:20,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:20,954 INFO L87 Difference]: Start difference. First operand 22763 states and 36135 transitions. Second operand 3 states. [2019-09-10 08:43:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:21,063 INFO L93 Difference]: Finished difference Result 31974 states and 50294 transitions. [2019-09-10 08:43:21,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:21,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 08:43:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:21,137 INFO L225 Difference]: With dead ends: 31974 [2019-09-10 08:43:21,137 INFO L226 Difference]: Without dead ends: 31974 [2019-09-10 08:43:21,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31974 states. [2019-09-10 08:43:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31974 to 31972. [2019-09-10 08:43:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31972 states. [2019-09-10 08:43:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31972 states to 31972 states and 50293 transitions. [2019-09-10 08:43:21,750 INFO L78 Accepts]: Start accepts. Automaton has 31972 states and 50293 transitions. Word has length 76 [2019-09-10 08:43:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:21,750 INFO L475 AbstractCegarLoop]: Abstraction has 31972 states and 50293 transitions. [2019-09-10 08:43:21,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 31972 states and 50293 transitions. [2019-09-10 08:43:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:43:21,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:21,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:21,752 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:21,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:21,752 INFO L82 PathProgramCache]: Analyzing trace with hash 384202792, now seen corresponding path program 1 times [2019-09-10 08:43:21,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:21,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:21,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:21,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:21,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:21,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:21,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:43:21,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:21,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:43:21,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:43:21,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:21,915 INFO L87 Difference]: Start difference. First operand 31972 states and 50293 transitions. Second operand 5 states. [2019-09-10 08:43:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:22,329 INFO L93 Difference]: Finished difference Result 44642 states and 70034 transitions. [2019-09-10 08:43:22,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:43:22,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:43:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:22,424 INFO L225 Difference]: With dead ends: 44642 [2019-09-10 08:43:22,424 INFO L226 Difference]: Without dead ends: 44642 [2019-09-10 08:43:22,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44642 states. [2019-09-10 08:43:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44642 to 44636. [2019-09-10 08:43:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44636 states. [2019-09-10 08:43:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44636 states to 44636 states and 70031 transitions. [2019-09-10 08:43:24,223 INFO L78 Accepts]: Start accepts. Automaton has 44636 states and 70031 transitions. Word has length 77 [2019-09-10 08:43:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:24,224 INFO L475 AbstractCegarLoop]: Abstraction has 44636 states and 70031 transitions. [2019-09-10 08:43:24,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:43:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 44636 states and 70031 transitions. [2019-09-10 08:43:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:43:24,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:24,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, 1, 1, 1, 1, 1] [2019-09-10 08:43:24,225 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:24,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:24,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1943011290, now seen corresponding path program 1 times [2019-09-10 08:43:24,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:24,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:24,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:24,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:24,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:24,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:24,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:43:24,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:24,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:43:24,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:43:24,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:24,454 INFO L87 Difference]: Start difference. First operand 44636 states and 70031 transitions. Second operand 5 states. [2019-09-10 08:43:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:24,861 INFO L93 Difference]: Finished difference Result 98581 states and 154639 transitions. [2019-09-10 08:43:24,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:43:24,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-10 08:43:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:25,053 INFO L225 Difference]: With dead ends: 98581 [2019-09-10 08:43:25,054 INFO L226 Difference]: Without dead ends: 98581 [2019-09-10 08:43:25,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98581 states. [2019-09-10 08:43:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98581 to 60991. [2019-09-10 08:43:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60991 states. [2019-09-10 08:43:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60991 states to 60991 states and 95413 transitions. [2019-09-10 08:43:26,463 INFO L78 Accepts]: Start accepts. Automaton has 60991 states and 95413 transitions. Word has length 80 [2019-09-10 08:43:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:26,463 INFO L475 AbstractCegarLoop]: Abstraction has 60991 states and 95413 transitions. [2019-09-10 08:43:26,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:43:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 60991 states and 95413 transitions. [2019-09-10 08:43:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:43:26,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:26,465 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:26,466 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:26,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:26,466 INFO L82 PathProgramCache]: Analyzing trace with hash 101898565, now seen corresponding path program 1 times [2019-09-10 08:43:26,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:26,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:26,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:26,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:26,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:26,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:26,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:43:26,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:26,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:43:26,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:43:26,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:26,844 INFO L87 Difference]: Start difference. First operand 60991 states and 95413 transitions. Second operand 5 states. [2019-09-10 08:43:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:27,206 INFO L93 Difference]: Finished difference Result 109002 states and 168932 transitions. [2019-09-10 08:43:27,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:43:27,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 08:43:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:27,401 INFO L225 Difference]: With dead ends: 109002 [2019-09-10 08:43:27,401 INFO L226 Difference]: Without dead ends: 109002 [2019-09-10 08:43:27,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:43:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109002 states. [2019-09-10 08:43:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109002 to 62353. [2019-09-10 08:43:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62353 states. [2019-09-10 08:43:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62353 states to 62353 states and 96766 transitions. [2019-09-10 08:43:29,924 INFO L78 Accepts]: Start accepts. Automaton has 62353 states and 96766 transitions. Word has length 81 [2019-09-10 08:43:29,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:29,925 INFO L475 AbstractCegarLoop]: Abstraction has 62353 states and 96766 transitions. [2019-09-10 08:43:29,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:43:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 62353 states and 96766 transitions. [2019-09-10 08:43:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:43:29,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:29,929 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:29,929 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:29,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:29,930 INFO L82 PathProgramCache]: Analyzing trace with hash 477987945, now seen corresponding path program 1 times [2019-09-10 08:43:29,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:29,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:29,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:29,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:29,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:30,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:30,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:30,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:30,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:30,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:30,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:30,030 INFO L87 Difference]: Start difference. First operand 62353 states and 96766 transitions. Second operand 3 states. [2019-09-10 08:43:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:30,204 INFO L93 Difference]: Finished difference Result 51902 states and 80237 transitions. [2019-09-10 08:43:30,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:30,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:43:30,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:30,282 INFO L225 Difference]: With dead ends: 51902 [2019-09-10 08:43:30,283 INFO L226 Difference]: Without dead ends: 51902 [2019-09-10 08:43:30,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51902 states. [2019-09-10 08:43:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51902 to 51900. [2019-09-10 08:43:31,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51900 states. [2019-09-10 08:43:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51900 states to 51900 states and 80236 transitions. [2019-09-10 08:43:31,200 INFO L78 Accepts]: Start accepts. Automaton has 51900 states and 80236 transitions. Word has length 107 [2019-09-10 08:43:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:31,200 INFO L475 AbstractCegarLoop]: Abstraction has 51900 states and 80236 transitions. [2019-09-10 08:43:31,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 51900 states and 80236 transitions. [2019-09-10 08:43:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:43:31,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:31,202 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:31,203 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:31,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:31,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1113947205, now seen corresponding path program 1 times [2019-09-10 08:43:31,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:31,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:31,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:31,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:31,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:31,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:31,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:31,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:31,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:31,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:31,285 INFO L87 Difference]: Start difference. First operand 51900 states and 80236 transitions. Second operand 3 states. [2019-09-10 08:43:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:31,361 INFO L93 Difference]: Finished difference Result 26255 states and 40321 transitions. [2019-09-10 08:43:31,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:31,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-10 08:43:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:31,394 INFO L225 Difference]: With dead ends: 26255 [2019-09-10 08:43:31,394 INFO L226 Difference]: Without dead ends: 26255 [2019-09-10 08:43:31,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26255 states. [2019-09-10 08:43:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26255 to 26253. [2019-09-10 08:43:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26253 states. [2019-09-10 08:43:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26253 states to 26253 states and 40320 transitions. [2019-09-10 08:43:31,736 INFO L78 Accepts]: Start accepts. Automaton has 26253 states and 40320 transitions. Word has length 107 [2019-09-10 08:43:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:31,737 INFO L475 AbstractCegarLoop]: Abstraction has 26253 states and 40320 transitions. [2019-09-10 08:43:31,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 26253 states and 40320 transitions. [2019-09-10 08:43:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:43:31,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:31,739 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:31,740 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:31,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:31,740 INFO L82 PathProgramCache]: Analyzing trace with hash 723995340, now seen corresponding path program 1 times [2019-09-10 08:43:31,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:31,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:31,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:43:31,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:31,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:43:31,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:31,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:43:31,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:43:31,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:31,877 INFO L87 Difference]: Start difference. First operand 26253 states and 40320 transitions. Second operand 5 states. [2019-09-10 08:43:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:32,044 INFO L93 Difference]: Finished difference Result 33715 states and 51799 transitions. [2019-09-10 08:43:32,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:43:32,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 08:43:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:32,089 INFO L225 Difference]: With dead ends: 33715 [2019-09-10 08:43:32,089 INFO L226 Difference]: Without dead ends: 33715 [2019-09-10 08:43:32,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33715 states. [2019-09-10 08:43:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33715 to 31859. [2019-09-10 08:43:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31859 states. [2019-09-10 08:43:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31859 states to 31859 states and 48914 transitions. [2019-09-10 08:43:33,102 INFO L78 Accepts]: Start accepts. Automaton has 31859 states and 48914 transitions. Word has length 110 [2019-09-10 08:43:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:33,102 INFO L475 AbstractCegarLoop]: Abstraction has 31859 states and 48914 transitions. [2019-09-10 08:43:33,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:43:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 31859 states and 48914 transitions. [2019-09-10 08:43:33,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 08:43:33,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:33,106 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:33,107 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:33,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1552059104, now seen corresponding path program 1 times [2019-09-10 08:43:33,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:33,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:33,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:43:33,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:33,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:43:33,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:33,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:43:33,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:43:33,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:33,221 INFO L87 Difference]: Start difference. First operand 31859 states and 48914 transitions. Second operand 5 states. [2019-09-10 08:43:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:33,361 INFO L93 Difference]: Finished difference Result 28275 states and 43353 transitions. [2019-09-10 08:43:33,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:43:33,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 08:43:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:33,391 INFO L225 Difference]: With dead ends: 28275 [2019-09-10 08:43:33,392 INFO L226 Difference]: Without dead ends: 28275 [2019-09-10 08:43:33,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28275 states. [2019-09-10 08:43:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28275 to 28251. [2019-09-10 08:43:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28251 states. [2019-09-10 08:43:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28251 states to 28251 states and 43332 transitions. [2019-09-10 08:43:33,636 INFO L78 Accepts]: Start accepts. Automaton has 28251 states and 43332 transitions. Word has length 110 [2019-09-10 08:43:33,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:33,636 INFO L475 AbstractCegarLoop]: Abstraction has 28251 states and 43332 transitions. [2019-09-10 08:43:33,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:43:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 28251 states and 43332 transitions. [2019-09-10 08:43:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:43:33,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:33,638 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:33,638 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:33,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:33,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1672529094, now seen corresponding path program 1 times [2019-09-10 08:43:33,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:33,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:33,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:33,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:33,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:43:33,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:33,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:33,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:33,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:33,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:33,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:33,714 INFO L87 Difference]: Start difference. First operand 28251 states and 43332 transitions. Second operand 3 states. [2019-09-10 08:43:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:33,845 INFO L93 Difference]: Finished difference Result 48673 states and 74491 transitions. [2019-09-10 08:43:33,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:33,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:43:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:33,891 INFO L225 Difference]: With dead ends: 48673 [2019-09-10 08:43:33,892 INFO L226 Difference]: Without dead ends: 48673 [2019-09-10 08:43:33,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48673 states. [2019-09-10 08:43:34,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48673 to 48570. [2019-09-10 08:43:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48570 states. [2019-09-10 08:43:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48570 states to 48570 states and 74389 transitions. [2019-09-10 08:43:34,489 INFO L78 Accepts]: Start accepts. Automaton has 48570 states and 74389 transitions. Word has length 111 [2019-09-10 08:43:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:34,490 INFO L475 AbstractCegarLoop]: Abstraction has 48570 states and 74389 transitions. [2019-09-10 08:43:34,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 48570 states and 74389 transitions. [2019-09-10 08:43:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 08:43:34,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:34,491 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:34,491 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:34,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:34,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2104094732, now seen corresponding path program 1 times [2019-09-10 08:43:34,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:34,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:34,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:34,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:34,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:43:34,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:34,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:34,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:34,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:34,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:34,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:34,577 INFO L87 Difference]: Start difference. First operand 48570 states and 74389 transitions. Second operand 3 states. [2019-09-10 08:43:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:34,634 INFO L93 Difference]: Finished difference Result 21584 states and 32891 transitions. [2019-09-10 08:43:34,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:34,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 08:43:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:34,658 INFO L225 Difference]: With dead ends: 21584 [2019-09-10 08:43:34,659 INFO L226 Difference]: Without dead ends: 21584 [2019-09-10 08:43:34,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21584 states. [2019-09-10 08:43:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21584 to 21582. [2019-09-10 08:43:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21582 states. [2019-09-10 08:43:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21582 states to 21582 states and 32890 transitions. [2019-09-10 08:43:34,909 INFO L78 Accepts]: Start accepts. Automaton has 21582 states and 32890 transitions. Word has length 111 [2019-09-10 08:43:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:34,910 INFO L475 AbstractCegarLoop]: Abstraction has 21582 states and 32890 transitions. [2019-09-10 08:43:34,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21582 states and 32890 transitions. [2019-09-10 08:43:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-10 08:43:34,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:34,911 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:34,912 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:34,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:34,912 INFO L82 PathProgramCache]: Analyzing trace with hash 767705507, now seen corresponding path program 1 times [2019-09-10 08:43:34,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:34,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:34,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:34,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:34,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:43:35,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:35,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:43:35,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:35,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:43:35,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:43:35,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:35,029 INFO L87 Difference]: Start difference. First operand 21582 states and 32890 transitions. Second operand 5 states. [2019-09-10 08:43:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:35,177 INFO L93 Difference]: Finished difference Result 23878 states and 36354 transitions. [2019-09-10 08:43:35,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:43:35,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-09-10 08:43:35,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:35,208 INFO L225 Difference]: With dead ends: 23878 [2019-09-10 08:43:35,208 INFO L226 Difference]: Without dead ends: 23878 [2019-09-10 08:43:35,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23878 states. [2019-09-10 08:43:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23878 to 23834. [2019-09-10 08:43:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23834 states. [2019-09-10 08:43:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23834 states to 23834 states and 36313 transitions. [2019-09-10 08:43:35,479 INFO L78 Accepts]: Start accepts. Automaton has 23834 states and 36313 transitions. Word has length 113 [2019-09-10 08:43:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:35,479 INFO L475 AbstractCegarLoop]: Abstraction has 23834 states and 36313 transitions. [2019-09-10 08:43:35,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:43:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 23834 states and 36313 transitions. [2019-09-10 08:43:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 08:43:35,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:35,480 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:35,481 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:35,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:35,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1430128237, now seen corresponding path program 1 times [2019-09-10 08:43:35,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:35,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:35,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:35,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:35,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:43:35,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:35,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:43:35,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:35,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:35,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:35,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:35,626 INFO L87 Difference]: Start difference. First operand 23834 states and 36313 transitions. Second operand 4 states. [2019-09-10 08:43:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:35,886 INFO L93 Difference]: Finished difference Result 46737 states and 70765 transitions. [2019-09-10 08:43:35,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:43:35,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-10 08:43:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:35,933 INFO L225 Difference]: With dead ends: 46737 [2019-09-10 08:43:35,934 INFO L226 Difference]: Without dead ends: 46737 [2019-09-10 08:43:35,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46737 states. [2019-09-10 08:43:36,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46737 to 46735. [2019-09-10 08:43:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46735 states. [2019-09-10 08:43:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46735 states to 46735 states and 70764 transitions. [2019-09-10 08:43:36,354 INFO L78 Accepts]: Start accepts. Automaton has 46735 states and 70764 transitions. Word has length 114 [2019-09-10 08:43:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:36,354 INFO L475 AbstractCegarLoop]: Abstraction has 46735 states and 70764 transitions. [2019-09-10 08:43:36,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:43:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 46735 states and 70764 transitions. [2019-09-10 08:43:36,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:43:36,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:36,357 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:36,357 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:36,357 INFO L82 PathProgramCache]: Analyzing trace with hash 710230287, now seen corresponding path program 1 times [2019-09-10 08:43:36,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:36,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:36,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:36,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:36,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:43:36,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:36,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:36,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:36,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:36,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:36,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:36,399 INFO L87 Difference]: Start difference. First operand 46735 states and 70764 transitions. Second operand 3 states. [2019-09-10 08:43:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:36,613 INFO L93 Difference]: Finished difference Result 93456 states and 141507 transitions. [2019-09-10 08:43:36,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:36,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 08:43:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:36,743 INFO L225 Difference]: With dead ends: 93456 [2019-09-10 08:43:36,743 INFO L226 Difference]: Without dead ends: 93456 [2019-09-10 08:43:36,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93456 states. [2019-09-10 08:43:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93456 to 46737. [2019-09-10 08:43:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46737 states. [2019-09-10 08:43:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46737 states to 46737 states and 70766 transitions. [2019-09-10 08:43:37,713 INFO L78 Accepts]: Start accepts. Automaton has 46737 states and 70766 transitions. Word has length 115 [2019-09-10 08:43:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:37,713 INFO L475 AbstractCegarLoop]: Abstraction has 46737 states and 70766 transitions. [2019-09-10 08:43:37,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 46737 states and 70766 transitions. [2019-09-10 08:43:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:43:37,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:37,717 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:37,717 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:37,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1524060780, now seen corresponding path program 1 times [2019-09-10 08:43:37,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:37,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:37,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:37,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:37,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:43:37,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:37,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:37,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:37,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:37,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:37,791 INFO L87 Difference]: Start difference. First operand 46737 states and 70766 transitions. Second operand 3 states. [2019-09-10 08:43:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:38,035 INFO L93 Difference]: Finished difference Result 90098 states and 135088 transitions. [2019-09-10 08:43:38,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:38,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 08:43:38,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:38,173 INFO L225 Difference]: With dead ends: 90098 [2019-09-10 08:43:38,174 INFO L226 Difference]: Without dead ends: 90098 [2019-09-10 08:43:38,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90098 states. [2019-09-10 08:43:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90098 to 90096. [2019-09-10 08:43:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90096 states. [2019-09-10 08:43:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90096 states to 90096 states and 135087 transitions. [2019-09-10 08:43:39,449 INFO L78 Accepts]: Start accepts. Automaton has 90096 states and 135087 transitions. Word has length 116 [2019-09-10 08:43:39,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:39,449 INFO L475 AbstractCegarLoop]: Abstraction has 90096 states and 135087 transitions. [2019-09-10 08:43:39,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 90096 states and 135087 transitions. [2019-09-10 08:43:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:43:39,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:39,454 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:39,454 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:39,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1435687287, now seen corresponding path program 1 times [2019-09-10 08:43:39,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:39,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:39,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:39,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:39,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:43:39,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:39,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:43:39,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:39,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:39,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:39,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:39,564 INFO L87 Difference]: Start difference. First operand 90096 states and 135087 transitions. Second operand 4 states. [2019-09-10 08:43:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:39,720 INFO L93 Difference]: Finished difference Result 68934 states and 103159 transitions. [2019-09-10 08:43:39,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:43:39,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-10 08:43:39,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:39,787 INFO L225 Difference]: With dead ends: 68934 [2019-09-10 08:43:39,787 INFO L226 Difference]: Without dead ends: 68874 [2019-09-10 08:43:39,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:39,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68874 states. [2019-09-10 08:43:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68874 to 68874. [2019-09-10 08:43:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68874 states. [2019-09-10 08:43:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68874 states to 68874 states and 103073 transitions. [2019-09-10 08:43:40,436 INFO L78 Accepts]: Start accepts. Automaton has 68874 states and 103073 transitions. Word has length 116 [2019-09-10 08:43:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:40,436 INFO L475 AbstractCegarLoop]: Abstraction has 68874 states and 103073 transitions. [2019-09-10 08:43:40,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:43:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 68874 states and 103073 transitions. [2019-09-10 08:43:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:43:40,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:40,439 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:40,439 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:40,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:40,439 INFO L82 PathProgramCache]: Analyzing trace with hash -562858339, now seen corresponding path program 1 times [2019-09-10 08:43:40,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:40,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:40,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:40,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:40,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:43:40,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:40,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:40,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:40,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:40,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:40,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:40,489 INFO L87 Difference]: Start difference. First operand 68874 states and 103073 transitions. Second operand 3 states. [2019-09-10 08:43:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:40,686 INFO L93 Difference]: Finished difference Result 92352 states and 137567 transitions. [2019-09-10 08:43:40,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:40,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 08:43:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:40,792 INFO L225 Difference]: With dead ends: 92352 [2019-09-10 08:43:40,792 INFO L226 Difference]: Without dead ends: 92352 [2019-09-10 08:43:40,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92352 states. [2019-09-10 08:43:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92352 to 69482. [2019-09-10 08:43:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69482 states. [2019-09-10 08:43:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69482 states to 69482 states and 103980 transitions. [2019-09-10 08:43:41,848 INFO L78 Accepts]: Start accepts. Automaton has 69482 states and 103980 transitions. Word has length 116 [2019-09-10 08:43:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:41,848 INFO L475 AbstractCegarLoop]: Abstraction has 69482 states and 103980 transitions. [2019-09-10 08:43:41,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 69482 states and 103980 transitions. [2019-09-10 08:43:41,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:43:41,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:41,852 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:41,852 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:41,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:41,853 INFO L82 PathProgramCache]: Analyzing trace with hash 366781120, now seen corresponding path program 1 times [2019-09-10 08:43:41,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:41,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:41,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:41,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:41,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:43:41,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:41,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:41,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:41,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:41,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:41,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:41,911 INFO L87 Difference]: Start difference. First operand 69482 states and 103980 transitions. Second operand 3 states. [2019-09-10 08:43:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:42,203 INFO L93 Difference]: Finished difference Result 98279 states and 145006 transitions. [2019-09-10 08:43:42,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:42,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 08:43:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:42,307 INFO L225 Difference]: With dead ends: 98279 [2019-09-10 08:43:42,307 INFO L226 Difference]: Without dead ends: 98279 [2019-09-10 08:43:42,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98279 states. [2019-09-10 08:43:43,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98279 to 71002. [2019-09-10 08:43:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71002 states. [2019-09-10 08:43:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71002 states to 71002 states and 105799 transitions. [2019-09-10 08:43:43,464 INFO L78 Accepts]: Start accepts. Automaton has 71002 states and 105799 transitions. Word has length 118 [2019-09-10 08:43:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:43,464 INFO L475 AbstractCegarLoop]: Abstraction has 71002 states and 105799 transitions. [2019-09-10 08:43:43,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 71002 states and 105799 transitions. [2019-09-10 08:43:43,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:43:43,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:43,467 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:43,467 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1646607505, now seen corresponding path program 1 times [2019-09-10 08:43:43,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:43,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:43,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:43,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:43,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:43:43,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:43,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:43:43,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:43,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:43,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:43,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:43,646 INFO L87 Difference]: Start difference. First operand 71002 states and 105799 transitions. Second operand 4 states. [2019-09-10 08:43:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:44,022 INFO L93 Difference]: Finished difference Result 116224 states and 171897 transitions. [2019-09-10 08:43:44,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:43:44,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-10 08:43:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:44,236 INFO L225 Difference]: With dead ends: 116224 [2019-09-10 08:43:44,237 INFO L226 Difference]: Without dead ends: 116224 [2019-09-10 08:43:44,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116224 states. [2019-09-10 08:43:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116224 to 116222. [2019-09-10 08:43:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116222 states. [2019-09-10 08:43:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116222 states to 116222 states and 171896 transitions. [2019-09-10 08:43:48,108 INFO L78 Accepts]: Start accepts. Automaton has 116222 states and 171896 transitions. Word has length 119 [2019-09-10 08:43:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:48,108 INFO L475 AbstractCegarLoop]: Abstraction has 116222 states and 171896 transitions. [2019-09-10 08:43:48,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:43:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 116222 states and 171896 transitions. [2019-09-10 08:43:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:43:48,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:48,112 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:48,112 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:48,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:48,113 INFO L82 PathProgramCache]: Analyzing trace with hash 790055070, now seen corresponding path program 1 times [2019-09-10 08:43:48,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:48,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:48,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:48,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:48,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:43:48,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:48,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:48,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:48,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:48,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:48,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:48,195 INFO L87 Difference]: Start difference. First operand 116222 states and 171896 transitions. Second operand 3 states. [2019-09-10 08:43:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:48,841 INFO L93 Difference]: Finished difference Result 223874 states and 327492 transitions. [2019-09-10 08:43:48,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:48,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 08:43:48,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:49,186 INFO L225 Difference]: With dead ends: 223874 [2019-09-10 08:43:49,187 INFO L226 Difference]: Without dead ends: 223874 [2019-09-10 08:43:49,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223874 states. [2019-09-10 08:43:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223874 to 223872. [2019-09-10 08:43:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223872 states. [2019-09-10 08:43:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223872 states to 223872 states and 327491 transitions. [2019-09-10 08:43:52,303 INFO L78 Accepts]: Start accepts. Automaton has 223872 states and 327491 transitions. Word has length 121 [2019-09-10 08:43:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:52,303 INFO L475 AbstractCegarLoop]: Abstraction has 223872 states and 327491 transitions. [2019-09-10 08:43:52,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:43:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 223872 states and 327491 transitions. [2019-09-10 08:43:52,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:43:52,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:52,310 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:52,310 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:52,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:52,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1680989343, now seen corresponding path program 1 times [2019-09-10 08:43:52,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:52,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:52,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:52,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:52,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:43:52,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:52,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:43:52,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:52,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:43:52,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:43:52,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:43:52,431 INFO L87 Difference]: Start difference. First operand 223872 states and 327491 transitions. Second operand 4 states. [2019-09-10 08:43:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:52,812 INFO L93 Difference]: Finished difference Result 182047 states and 265691 transitions. [2019-09-10 08:43:52,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:43:52,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-10 08:43:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:53,022 INFO L225 Difference]: With dead ends: 182047 [2019-09-10 08:43:53,022 INFO L226 Difference]: Without dead ends: 181999 [2019-09-10 08:43:53,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:43:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181999 states. [2019-09-10 08:43:57,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181999 to 181999. [2019-09-10 08:43:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181999 states. [2019-09-10 08:43:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181999 states to 181999 states and 265628 transitions. [2019-09-10 08:43:58,199 INFO L78 Accepts]: Start accepts. Automaton has 181999 states and 265628 transitions. Word has length 121 [2019-09-10 08:43:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:43:58,199 INFO L475 AbstractCegarLoop]: Abstraction has 181999 states and 265628 transitions. [2019-09-10 08:43:58,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:43:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 181999 states and 265628 transitions. [2019-09-10 08:43:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 08:43:58,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:43:58,204 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:43:58,204 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:43:58,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:43:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1189508418, now seen corresponding path program 1 times [2019-09-10 08:43:58,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:43:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:58,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:43:58,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:43:58,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:43:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:43:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:43:58,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:43:58,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:43:58,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:43:58,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:43:58,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:43:58,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:58,268 INFO L87 Difference]: Start difference. First operand 181999 states and 265628 transitions. Second operand 3 states. [2019-09-10 08:43:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:43:58,852 INFO L93 Difference]: Finished difference Result 282241 states and 408732 transitions. [2019-09-10 08:43:58,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:43:58,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-10 08:43:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:43:59,187 INFO L225 Difference]: With dead ends: 282241 [2019-09-10 08:43:59,187 INFO L226 Difference]: Without dead ends: 282241 [2019-09-10 08:43:59,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:43:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282241 states. [2019-09-10 08:44:06,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282241 to 185951. [2019-09-10 08:44:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185951 states. [2019-09-10 08:44:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185951 states to 185951 states and 270483 transitions. [2019-09-10 08:44:07,121 INFO L78 Accepts]: Start accepts. Automaton has 185951 states and 270483 transitions. Word has length 123 [2019-09-10 08:44:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:07,122 INFO L475 AbstractCegarLoop]: Abstraction has 185951 states and 270483 transitions. [2019-09-10 08:44:07,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 185951 states and 270483 transitions. [2019-09-10 08:44:07,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 08:44:07,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:07,127 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:07,127 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:07,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:07,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1176955519, now seen corresponding path program 1 times [2019-09-10 08:44:07,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:07,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:07,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:07,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:07,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:44:07,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:07,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:07,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:07,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:07,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:07,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:07,248 INFO L87 Difference]: Start difference. First operand 185951 states and 270483 transitions. Second operand 4 states. [2019-09-10 08:44:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:08,024 INFO L93 Difference]: Finished difference Result 354445 states and 510364 transitions. [2019-09-10 08:44:08,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:08,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-10 08:44:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:08,546 INFO L225 Difference]: With dead ends: 354445 [2019-09-10 08:44:08,546 INFO L226 Difference]: Without dead ends: 354445 [2019-09-10 08:44:08,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354445 states. [2019-09-10 08:44:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354445 to 354443. [2019-09-10 08:44:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354443 states. [2019-09-10 08:44:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354443 states to 354443 states and 510363 transitions. [2019-09-10 08:44:17,271 INFO L78 Accepts]: Start accepts. Automaton has 354443 states and 510363 transitions. Word has length 124 [2019-09-10 08:44:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:17,271 INFO L475 AbstractCegarLoop]: Abstraction has 354443 states and 510363 transitions. [2019-09-10 08:44:17,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 354443 states and 510363 transitions. [2019-09-10 08:44:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 08:44:17,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:17,280 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:17,280 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:17,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:17,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1229350557, now seen corresponding path program 1 times [2019-09-10 08:44:17,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:17,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:17,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:17,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:17,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:44:17,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:17,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:17,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:17,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:17,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:17,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:17,321 INFO L87 Difference]: Start difference. First operand 354443 states and 510363 transitions. Second operand 3 states. [2019-09-10 08:44:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:25,156 INFO L93 Difference]: Finished difference Result 708794 states and 1020607 transitions. [2019-09-10 08:44:25,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:25,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 08:44:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:26,250 INFO L225 Difference]: With dead ends: 708794 [2019-09-10 08:44:26,250 INFO L226 Difference]: Without dead ends: 708794 [2019-09-10 08:44:26,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708794 states. [2019-09-10 08:44:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708794 to 354449. [2019-09-10 08:44:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354449 states. [2019-09-10 08:44:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354449 states to 354449 states and 510369 transitions. [2019-09-10 08:44:33,546 INFO L78 Accepts]: Start accepts. Automaton has 354449 states and 510369 transitions. Word has length 125 [2019-09-10 08:44:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:33,546 INFO L475 AbstractCegarLoop]: Abstraction has 354449 states and 510369 transitions. [2019-09-10 08:44:33,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:44:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 354449 states and 510369 transitions. [2019-09-10 08:44:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:44:33,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:33,558 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:33,559 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:33,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:33,559 INFO L82 PathProgramCache]: Analyzing trace with hash -441572160, now seen corresponding path program 1 times [2019-09-10 08:44:33,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:33,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:33,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:33,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:33,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:44:33,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:33,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:44:33,658 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:33,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:44:33,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:44:33,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:44:33,659 INFO L87 Difference]: Start difference. First operand 354449 states and 510369 transitions. Second operand 4 states. [2019-09-10 08:44:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:34,480 INFO L93 Difference]: Finished difference Result 354634 states and 510585 transitions. [2019-09-10 08:44:34,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:44:34,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-10 08:44:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:35,024 INFO L225 Difference]: With dead ends: 354634 [2019-09-10 08:44:35,025 INFO L226 Difference]: Without dead ends: 354443 [2019-09-10 08:44:35,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:44:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354443 states. [2019-09-10 08:44:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354443 to 354443. [2019-09-10 08:44:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354443 states. [2019-09-10 08:44:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354443 states to 354443 states and 510357 transitions. [2019-09-10 08:44:46,176 INFO L78 Accepts]: Start accepts. Automaton has 354443 states and 510357 transitions. Word has length 126 [2019-09-10 08:44:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:44:46,177 INFO L475 AbstractCegarLoop]: Abstraction has 354443 states and 510357 transitions. [2019-09-10 08:44:46,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:44:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 354443 states and 510357 transitions. [2019-09-10 08:44:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 08:44:46,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:44:46,189 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:44:46,190 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:44:46,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:44:46,190 INFO L82 PathProgramCache]: Analyzing trace with hash -488324446, now seen corresponding path program 1 times [2019-09-10 08:44:46,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:44:46,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:46,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:44:46,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:44:46,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:44:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:44:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:44:46,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:44:46,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:44:46,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:44:46,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:44:46,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:44:46,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:46,259 INFO L87 Difference]: Start difference. First operand 354443 states and 510357 transitions. Second operand 3 states. [2019-09-10 08:44:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:44:48,617 INFO L93 Difference]: Finished difference Result 522979 states and 742955 transitions. [2019-09-10 08:44:48,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:44:48,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-10 08:44:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:44:49,365 INFO L225 Difference]: With dead ends: 522979 [2019-09-10 08:44:49,365 INFO L226 Difference]: Without dead ends: 522979 [2019-09-10 08:44:49,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:44:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522979 states. [2019-09-10 08:45:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522979 to 522977. [2019-09-10 08:45:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522977 states. [2019-09-10 08:45:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522977 states to 522977 states and 742954 transitions. [2019-09-10 08:45:02,096 INFO L78 Accepts]: Start accepts. Automaton has 522977 states and 742954 transitions. Word has length 126 [2019-09-10 08:45:02,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:02,097 INFO L475 AbstractCegarLoop]: Abstraction has 522977 states and 742954 transitions. [2019-09-10 08:45:02,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:45:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 522977 states and 742954 transitions. [2019-09-10 08:45:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:45:02,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:02,111 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:02,111 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:02,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:02,111 INFO L82 PathProgramCache]: Analyzing trace with hash -21553747, now seen corresponding path program 1 times [2019-09-10 08:45:02,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:02,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:02,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:02,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:02,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:45:02,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:02,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:45:02,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:02,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:45:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:45:02,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:02,191 INFO L87 Difference]: Start difference. First operand 522977 states and 742954 transitions. Second operand 5 states. [2019-09-10 08:45:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:04,911 INFO L93 Difference]: Finished difference Result 522977 states and 733508 transitions. [2019-09-10 08:45:04,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:45:04,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-09-10 08:45:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:05,585 INFO L225 Difference]: With dead ends: 522977 [2019-09-10 08:45:05,586 INFO L226 Difference]: Without dead ends: 522977 [2019-09-10 08:45:05,586 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 08:45:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522977 states. [2019-09-10 08:45:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522977 to 522977. [2019-09-10 08:45:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522977 states. [2019-09-10 08:45:20,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522977 states to 522977 states and 733508 transitions. [2019-09-10 08:45:20,589 INFO L78 Accepts]: Start accepts. Automaton has 522977 states and 733508 transitions. Word has length 129 [2019-09-10 08:45:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:20,589 INFO L475 AbstractCegarLoop]: Abstraction has 522977 states and 733508 transitions. [2019-09-10 08:45:20,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:45:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 522977 states and 733508 transitions. [2019-09-10 08:45:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 08:45:20,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:20,599 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:20,599 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:20,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:20,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1966861496, now seen corresponding path program 1 times [2019-09-10 08:45:20,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:20,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:20,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:20,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:20,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:45:20,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:45:20,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:45:20,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:20,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:20,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:20,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:45:20,720 INFO L87 Difference]: Start difference. First operand 522977 states and 733508 transitions. Second operand 4 states. [2019-09-10 08:45:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:27,788 INFO L93 Difference]: Finished difference Result 462343 states and 647174 transitions. [2019-09-10 08:45:27,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:27,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 08:45:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:28,442 INFO L225 Difference]: With dead ends: 462343 [2019-09-10 08:45:28,442 INFO L226 Difference]: Without dead ends: 462343 [2019-09-10 08:45:28,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:45:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462343 states. [2019-09-10 08:45:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462343 to 462298. [2019-09-10 08:45:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462298 states. [2019-09-10 08:45:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462298 states to 462298 states and 647121 transitions. [2019-09-10 08:45:34,612 INFO L78 Accepts]: Start accepts. Automaton has 462298 states and 647121 transitions. Word has length 129 [2019-09-10 08:45:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:45:34,612 INFO L475 AbstractCegarLoop]: Abstraction has 462298 states and 647121 transitions. [2019-09-10 08:45:34,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:45:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 462298 states and 647121 transitions. [2019-09-10 08:45:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:45:34,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:45:34,620 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:45:34,621 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:45:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:34,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1783487415, now seen corresponding path program 1 times [2019-09-10 08:45:34,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:45:34,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:34,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:34,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:45:34,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:45:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:45:34,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:45:34,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:45:34,802 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2019-09-10 08:45:34,804 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [128], [133], [136], [148], [151], [154], [156], [158], [161], [166], [169], [181], [189], [191], [194], [199], [209], [212], [214], [217], [220], [222], [224], [227], [230], [233], [236], [243], [251], [253], [256], [257], [259], [268], [271], [282], [285], [295], [307], [309], [311], [314], [345], [355], [365], [371], [375], [377], [381], [383], [386], [389], [392], [395], [398], [400], [404], [407], [410], [413], [415], [417], [447], [449], [453], [455], [458], [461], [464], [467], [470], [472], [489], [499], [596], [599], [602], [623], [624], [628], [629], [630] [2019-09-10 08:45:34,857 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:45:34,857 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:45:35,003 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:45:35,721 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:45:35,724 INFO L272 AbstractInterpreter]: Visited 126 different actions 851 times. Merged at 75 different actions 676 times. Widened at 29 different actions 129 times. Performed 2242 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2242 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 22 different actions. Largest state had 174 variables. [2019-09-10 08:45:35,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:45:35,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:45:35,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:45:35,731 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) [2019-09-10 08:45:35,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:45:35,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:45:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:45:35,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:45:36,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:45:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:45:42,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:45:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:45:42,222 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:45:42,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2019-09-10 08:45:42,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:45:42,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:45:42,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:45:42,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:45:42,225 INFO L87 Difference]: Start difference. First operand 462298 states and 647121 transitions. Second operand 4 states. [2019-09-10 08:45:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:45:45,956 INFO L93 Difference]: Finished difference Result 815316 states and 1139500 transitions. [2019-09-10 08:45:45,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:45:45,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-10 08:45:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:45:47,624 INFO L225 Difference]: With dead ends: 815316 [2019-09-10 08:45:47,625 INFO L226 Difference]: Without dead ends: 815316 [2019-09-10 08:45:47,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:45:48,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815316 states. [2019-09-10 08:46:04,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815316 to 812785. [2019-09-10 08:46:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812785 states. [2019-09-10 08:46:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812785 states to 812785 states and 1136298 transitions. [2019-09-10 08:46:05,529 INFO L78 Accepts]: Start accepts. Automaton has 812785 states and 1136298 transitions. Word has length 131 [2019-09-10 08:46:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:05,530 INFO L475 AbstractCegarLoop]: Abstraction has 812785 states and 1136298 transitions. [2019-09-10 08:46:05,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 812785 states and 1136298 transitions. [2019-09-10 08:46:05,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:46:05,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:05,568 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:05,568 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:05,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:05,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1228015932, now seen corresponding path program 1 times [2019-09-10 08:46:05,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:05,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:05,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:46:05,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:05,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:05,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:05,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:05,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:05,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:05,698 INFO L87 Difference]: Start difference. First operand 812785 states and 1136298 transitions. Second operand 4 states. [2019-09-10 08:46:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:46:16,502 INFO L93 Difference]: Finished difference Result 977954 states and 1364752 transitions. [2019-09-10 08:46:16,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:46:16,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-10 08:46:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:46:17,961 INFO L225 Difference]: With dead ends: 977954 [2019-09-10 08:46:17,961 INFO L226 Difference]: Without dead ends: 977954 [2019-09-10 08:46:17,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977954 states. [2019-09-10 08:46:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977954 to 977488. [2019-09-10 08:46:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977488 states. [2019-09-10 08:46:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977488 states to 977488 states and 1364288 transitions. [2019-09-10 08:46:52,295 INFO L78 Accepts]: Start accepts. Automaton has 977488 states and 1364288 transitions. Word has length 131 [2019-09-10 08:46:52,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:46:52,296 INFO L475 AbstractCegarLoop]: Abstraction has 977488 states and 1364288 transitions. [2019-09-10 08:46:52,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:46:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 977488 states and 1364288 transitions. [2019-09-10 08:46:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 08:46:52,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:46:52,313 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:46:52,313 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:46:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:46:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2093320176, now seen corresponding path program 1 times [2019-09-10 08:46:52,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:46:52,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:52,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:46:52,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:46:52,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:46:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:46:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:46:52,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:46:52,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:46:52,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:46:52,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:46:52,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:46:52,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:46:52,478 INFO L87 Difference]: Start difference. First operand 977488 states and 1364288 transitions. Second operand 4 states. [2019-09-10 08:47:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:04,597 INFO L93 Difference]: Finished difference Result 977663 states and 1364473 transitions. [2019-09-10 08:47:04,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:47:04,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-10 08:47:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:06,183 INFO L225 Difference]: With dead ends: 977663 [2019-09-10 08:47:06,183 INFO L226 Difference]: Without dead ends: 977663 [2019-09-10 08:47:06,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:47:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977663 states. [2019-09-10 08:47:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977663 to 977597. [2019-09-10 08:47:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977597 states. [2019-09-10 08:47:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977597 states to 977597 states and 1364400 transitions. [2019-09-10 08:47:33,944 INFO L78 Accepts]: Start accepts. Automaton has 977597 states and 1364400 transitions. Word has length 131 [2019-09-10 08:47:33,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:47:33,944 INFO L475 AbstractCegarLoop]: Abstraction has 977597 states and 1364400 transitions. [2019-09-10 08:47:33,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:47:33,944 INFO L276 IsEmpty]: Start isEmpty. Operand 977597 states and 1364400 transitions. [2019-09-10 08:47:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 08:47:33,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:47:33,961 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:47:33,962 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:47:33,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:47:33,962 INFO L82 PathProgramCache]: Analyzing trace with hash -272901588, now seen corresponding path program 1 times [2019-09-10 08:47:33,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:47:33,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:33,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:47:33,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:47:33,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:47:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:47:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:47:34,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:47:34,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:47:34,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:47:34,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:47:34,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:47:34,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:34,012 INFO L87 Difference]: Start difference. First operand 977597 states and 1364400 transitions. Second operand 3 states. [2019-09-10 08:47:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:47:52,775 INFO L93 Difference]: Finished difference Result 1954980 states and 2728548 transitions. [2019-09-10 08:47:52,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:47:52,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-09-10 08:47:52,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:47:56,874 INFO L225 Difference]: With dead ends: 1954980 [2019-09-10 08:47:56,874 INFO L226 Difference]: Without dead ends: 1954980 [2019-09-10 08:47:56,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:47:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954980 states. [2019-09-10 08:48:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954980 to 977607. [2019-09-10 08:48:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977607 states. [2019-09-10 08:48:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977607 states to 977607 states and 1364410 transitions. [2019-09-10 08:48:32,386 INFO L78 Accepts]: Start accepts. Automaton has 977607 states and 1364410 transitions. Word has length 132 [2019-09-10 08:48:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:48:32,386 INFO L475 AbstractCegarLoop]: Abstraction has 977607 states and 1364410 transitions. [2019-09-10 08:48:32,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:48:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 977607 states and 1364410 transitions. [2019-09-10 08:48:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:48:32,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:48:32,397 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:48:32,397 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:48:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:32,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2084389446, now seen corresponding path program 1 times [2019-09-10 08:48:32,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:48:32,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:32,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:32,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:48:32,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:48:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:48:32,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:48:32,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:48:32,505 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 08:48:32,506 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [10], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [128], [133], [143], [146], [148], [151], [156], [158], [161], [166], [169], [181], [189], [191], [194], [199], [209], [212], [214], [222], [224], [227], [230], [233], [236], [243], [251], [253], [256], [257], [259], [268], [271], [282], [285], [293], [299], [307], [309], [311], [314], [317], [320], [323], [326], [328], [345], [355], [371], [375], [377], [381], [383], [386], [404], [407], [410], [413], [415], [417], [437], [441], [451], [453], [455], [458], [461], [464], [467], [470], [472], [489], [499], [583], [586], [589], [596], [599], [602], [623], [624], [628], [629], [630] [2019-09-10 08:48:32,516 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:48:32,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:48:32,553 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:48:33,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:48:33,049 INFO L272 AbstractInterpreter]: Visited 127 different actions 910 times. Merged at 74 different actions 732 times. Widened at 31 different actions 144 times. Performed 2492 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2492 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 40 fixpoints after 20 different actions. Largest state had 174 variables. [2019-09-10 08:48:33,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:48:33,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:48:33,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:48:33,049 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:48:33,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:48:33,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:48:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:48:33,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 08:48:33,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:48:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:48:33,275 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:48:33,316 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:48:33,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:48:33,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2019-09-10 08:48:33,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:48:33,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:48:33,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:48:33,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:48:33,331 INFO L87 Difference]: Start difference. First operand 977607 states and 1364410 transitions. Second operand 4 states. [2019-09-10 08:48:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:48:37,122 INFO L93 Difference]: Finished difference Result 978071 states and 1362038 transitions. [2019-09-10 08:48:37,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:48:37,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 08:48:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:48:49,138 INFO L225 Difference]: With dead ends: 978071 [2019-09-10 08:48:49,138 INFO L226 Difference]: Without dead ends: 978071 [2019-09-10 08:48:49,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:48:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978071 states. [2019-09-10 08:49:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978071 to 977607. [2019-09-10 08:49:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977607 states. [2019-09-10 08:49:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977607 states to 977607 states and 1361575 transitions. [2019-09-10 08:49:04,356 INFO L78 Accepts]: Start accepts. Automaton has 977607 states and 1361575 transitions. Word has length 133 [2019-09-10 08:49:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:04,356 INFO L475 AbstractCegarLoop]: Abstraction has 977607 states and 1361575 transitions. [2019-09-10 08:49:04,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 977607 states and 1361575 transitions. [2019-09-10 08:49:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:49:04,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:04,369 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:04,369 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:04,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1015813875, now seen corresponding path program 1 times [2019-09-10 08:49:04,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:04,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:04,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:04,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:04,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:49:04,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:49:04,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:49:04,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 134 with the following transitions: [2019-09-10 08:49:04,573 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [10], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [128], [133], [143], [146], [148], [151], [154], [156], [158], [161], [166], [169], [181], [189], [191], [194], [199], [209], [214], [217], [220], [222], [224], [227], [230], [233], [236], [243], [251], [253], [256], [257], [259], [268], [271], [282], [285], [295], [301], [307], [309], [311], [314], [317], [320], [323], [326], [328], [345], [355], [371], [375], [377], [381], [383], [386], [404], [407], [410], [413], [415], [417], [437], [451], [453], [455], [458], [461], [464], [467], [470], [472], [489], [499], [583], [586], [589], [596], [599], [602], [623], [624], [628], [629], [630] [2019-09-10 08:49:04,583 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:49:04,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:49:04,619 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:49:05,021 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:49:05,022 INFO L272 AbstractInterpreter]: Visited 128 different actions 798 times. Merged at 75 different actions 628 times. Widened at 28 different actions 73 times. Performed 2268 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2268 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 34 fixpoints after 13 different actions. Largest state had 174 variables. [2019-09-10 08:49:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:05,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:49:05,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:49:05,022 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:49:05,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:05,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:49:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:05,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:49:05,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:49:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:49:05,191 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:49:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:49:05,230 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:49:05,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2019-09-10 08:49:05,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:05,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:49:05,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:49:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:49:05,231 INFO L87 Difference]: Start difference. First operand 977607 states and 1361575 transitions. Second operand 4 states. [2019-09-10 08:49:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:17,652 INFO L93 Difference]: Finished difference Result 895877 states and 1242268 transitions. [2019-09-10 08:49:17,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:49:17,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 08:49:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:18,995 INFO L225 Difference]: With dead ends: 895877 [2019-09-10 08:49:18,995 INFO L226 Difference]: Without dead ends: 895877 [2019-09-10 08:49:18,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:49:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895877 states. [2019-09-10 08:49:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895877 to 712134. [2019-09-10 08:49:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712134 states. [2019-09-10 08:49:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712134 states to 712134 states and 988037 transitions. [2019-09-10 08:49:31,620 INFO L78 Accepts]: Start accepts. Automaton has 712134 states and 988037 transitions. Word has length 133 [2019-09-10 08:49:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:31,620 INFO L475 AbstractCegarLoop]: Abstraction has 712134 states and 988037 transitions. [2019-09-10 08:49:31,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 712134 states and 988037 transitions. [2019-09-10 08:49:31,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:49:31,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:31,631 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:31,631 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:31,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:31,631 INFO L82 PathProgramCache]: Analyzing trace with hash -635268529, now seen corresponding path program 1 times [2019-09-10 08:49:31,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:31,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:31,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:31,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:31,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:31,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:49:31,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:31,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:49:31,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:31,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:49:31,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:49:31,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:49:31,769 INFO L87 Difference]: Start difference. First operand 712134 states and 988037 transitions. Second operand 4 states. [2019-09-10 08:49:41,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:41,629 INFO L93 Difference]: Finished difference Result 712558 states and 988503 transitions. [2019-09-10 08:49:41,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:49:41,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 08:49:41,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:42,669 INFO L225 Difference]: With dead ends: 712558 [2019-09-10 08:49:42,669 INFO L226 Difference]: Without dead ends: 712558 [2019-09-10 08:49:42,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:49:43,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712558 states. [2019-09-10 08:49:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712558 to 712391. [2019-09-10 08:49:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712391 states. [2019-09-10 08:49:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712391 states to 712391 states and 988299 transitions. [2019-09-10 08:49:54,077 INFO L78 Accepts]: Start accepts. Automaton has 712391 states and 988299 transitions. Word has length 133 [2019-09-10 08:49:54,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:54,078 INFO L475 AbstractCegarLoop]: Abstraction has 712391 states and 988299 transitions. [2019-09-10 08:49:54,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 712391 states and 988299 transitions. [2019-09-10 08:49:54,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 08:49:54,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:54,090 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:54,090 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:54,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:54,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1009907183, now seen corresponding path program 1 times [2019-09-10 08:49:54,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:54,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:54,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:54,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:54,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:49:54,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:54,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:49:54,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:54,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:49:54,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:49:54,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:49:54,179 INFO L87 Difference]: Start difference. First operand 712391 states and 988299 transitions. Second operand 4 states. [2019-09-10 08:50:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:04,106 INFO L93 Difference]: Finished difference Result 618561 states and 858259 transitions. [2019-09-10 08:50:04,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:04,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 08:50:04,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:04,878 INFO L225 Difference]: With dead ends: 618561 [2019-09-10 08:50:04,878 INFO L226 Difference]: Without dead ends: 618513 [2019-09-10 08:50:04,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:50:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618513 states. [2019-09-10 08:50:11,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618513 to 618510. [2019-09-10 08:50:11,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618510 states. [2019-09-10 08:50:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618510 states to 618510 states and 858208 transitions. [2019-09-10 08:50:13,701 INFO L78 Accepts]: Start accepts. Automaton has 618510 states and 858208 transitions. Word has length 133 [2019-09-10 08:50:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:13,701 INFO L475 AbstractCegarLoop]: Abstraction has 618510 states and 858208 transitions. [2019-09-10 08:50:13,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 618510 states and 858208 transitions. [2019-09-10 08:50:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:50:13,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:13,710 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:13,710 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:13,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:13,710 INFO L82 PathProgramCache]: Analyzing trace with hash -589833549, now seen corresponding path program 1 times [2019-09-10 08:50:13,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:13,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:13,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:13,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:13,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:50:13,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:13,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:13,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:13,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:13,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:13,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:13,826 INFO L87 Difference]: Start difference. First operand 618510 states and 858208 transitions. Second operand 4 states. [2019-09-10 08:50:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:18,040 INFO L93 Difference]: Finished difference Result 1211102 states and 1651747 transitions. [2019-09-10 08:50:18,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:50:18,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 08:50:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:30,537 INFO L225 Difference]: With dead ends: 1211102 [2019-09-10 08:50:30,538 INFO L226 Difference]: Without dead ends: 1211102 [2019-09-10 08:50:30,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:50:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211102 states. [2019-09-10 08:50:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211102 to 978224. [2019-09-10 08:50:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978224 states. [2019-09-10 08:50:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978224 states to 978224 states and 1338914 transitions. [2019-09-10 08:50:47,013 INFO L78 Accepts]: Start accepts. Automaton has 978224 states and 1338914 transitions. Word has length 135 [2019-09-10 08:50:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:47,013 INFO L475 AbstractCegarLoop]: Abstraction has 978224 states and 1338914 transitions. [2019-09-10 08:50:47,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 978224 states and 1338914 transitions. [2019-09-10 08:50:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:50:47,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:47,019 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:47,019 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:47,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1852344899, now seen corresponding path program 1 times [2019-09-10 08:50:47,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:47,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:47,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:47,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:47,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:50:47,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:50:47,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:50:47,196 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:50:47,196 INFO L207 CegarAbsIntRunner]: [0], [5], [8], [10], [13], [15], [20], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [125], [128], [133], [136], [148], [156], [158], [161], [166], [176], [179], [181], [184], [187], [189], [191], [194], [199], [202], [214], [217], [220], [222], [224], [227], [230], [233], [236], [243], [251], [253], [256], [257], [259], [268], [271], [282], [285], [295], [303], [305], [309], [311], [314], [332], [335], [338], [341], [343], [345], [365], [379], [381], [383], [386], [389], [392], [395], [398], [400], [417], [427], [443], [447], [449], [453], [455], [458], [476], [479], [482], [485], [487], [489], [509], [557], [560], [563], [570], [573], [576], [609], [612], [615], [623], [624], [628], [629], [630] [2019-09-10 08:50:47,200 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:50:47,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:50:47,230 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:50:47,625 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:50:47,626 INFO L272 AbstractInterpreter]: Visited 130 different actions 835 times. Merged at 75 different actions 662 times. Widened at 30 different actions 101 times. Performed 2291 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2291 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 38 fixpoints after 15 different actions. Largest state had 174 variables. [2019-09-10 08:50:47,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:47,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:50:47,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:50:47,627 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:50:47,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:47,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:50:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:47,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 08:50:47,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:50:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:50:47,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:50:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:50:49,919 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 08:50:49,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2019-09-10 08:50:49,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:49,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:49,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:49,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:50:49,921 INFO L87 Difference]: Start difference. First operand 978224 states and 1338914 transitions. Second operand 4 states. [2019-09-10 08:50:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:55,509 INFO L93 Difference]: Finished difference Result 1533551 states and 2094627 transitions. [2019-09-10 08:50:55,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:55,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 08:50:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:12,980 INFO L225 Difference]: With dead ends: 1533551 [2019-09-10 08:51:12,980 INFO L226 Difference]: Without dead ends: 1533551 [2019-09-10 08:51:12,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:51:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533551 states. [2019-09-10 08:51:31,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533551 to 1339543. [2019-09-10 08:51:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339543 states. [2019-09-10 08:51:53,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339543 states to 1339543 states and 1830804 transitions. [2019-09-10 08:51:53,971 INFO L78 Accepts]: Start accepts. Automaton has 1339543 states and 1830804 transitions. Word has length 135 [2019-09-10 08:51:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:53,972 INFO L475 AbstractCegarLoop]: Abstraction has 1339543 states and 1830804 transitions. [2019-09-10 08:51:53,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1339543 states and 1830804 transitions. [2019-09-10 08:51:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:51:53,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:53,979 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:53,979 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash -95250939, now seen corresponding path program 1 times [2019-09-10 08:51:53,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:53,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:53,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:53,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:53,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:51:54,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:54,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:51:54,116 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:54,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:51:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:51:54,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:51:54,117 INFO L87 Difference]: Start difference. First operand 1339543 states and 1830804 transitions. Second operand 4 states. [2019-09-10 08:52:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:03,826 INFO L93 Difference]: Finished difference Result 1381985 states and 1883541 transitions. [2019-09-10 08:52:03,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:52:03,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-10 08:52:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:06,617 INFO L225 Difference]: With dead ends: 1381985 [2019-09-10 08:52:06,618 INFO L226 Difference]: Without dead ends: 1381985 [2019-09-10 08:52:06,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:52:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381985 states. [2019-09-10 08:52:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381985 to 1381155. [2019-09-10 08:52:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381155 states.