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/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:49,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:49,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:49,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:49,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:49,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:49,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:49,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:49,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:49,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:49,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:49,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:49,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:49,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:49,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:49,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:49,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:49,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:49,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:49,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:49,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:49,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:49,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:49,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:49,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:49,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:49,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:49,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:49,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:49,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:49,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:49,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:49,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:49,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:49,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:49,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:49,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:49,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:49,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:49,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:49,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:49,748 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-16 17:04:49,776 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:49,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:49,777 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:49,777 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:49,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:49,779 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:49,780 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:49,780 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:49,780 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:49,780 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:49,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:49,783 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:49,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:49,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:49,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:49,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:49,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:49,785 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:49,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:49,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:49,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:49,786 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:49,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:49,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:49,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:49,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:49,787 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:49,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:49,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:49,788 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:49,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:49,856 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:49,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:49,864 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:49,864 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:49,865 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-09-16 17:04:49,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b75fd2be/c8b2ca574cf84870a207426f107d3b44/FLAGf3bb95bd4 [2019-09-16 17:04:50,436 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:50,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-09-16 17:04:50,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b75fd2be/c8b2ca574cf84870a207426f107d3b44/FLAGf3bb95bd4 [2019-09-16 17:04:50,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b75fd2be/c8b2ca574cf84870a207426f107d3b44 [2019-09-16 17:04:50,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:50,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:50,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:50,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:50,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:50,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:50" (1/1) ... [2019-09-16 17:04:50,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@999c6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:50, skipping insertion in model container [2019-09-16 17:04:50,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:50" (1/1) ... [2019-09-16 17:04:50,803 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:50,835 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:51,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:51,022 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:51,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:51,059 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:51,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:51 WrapperNode [2019-09-16 17:04:51,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:51,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:51,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:51,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:51,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:51" (1/1) ... [2019-09-16 17:04:51,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:51" (1/1) ... [2019-09-16 17:04:51,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:51" (1/1) ... [2019-09-16 17:04:51,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:51" (1/1) ... [2019-09-16 17:04:51,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:51" (1/1) ... [2019-09-16 17:04:51,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:51" (1/1) ... [2019-09-16 17:04:51,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:51" (1/1) ... [2019-09-16 17:04:51,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:51,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:51,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:51,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:51,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:51" (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-16 17:04:51,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:51,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:51,247 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:51,562 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:51,562 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:51,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:51 BoogieIcfgContainer [2019-09-16 17:04:51,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:51,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:51,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:51,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:51,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:50" (1/3) ... [2019-09-16 17:04:51,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f894314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:51, skipping insertion in model container [2019-09-16 17:04:51,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:51" (2/3) ... [2019-09-16 17:04:51,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f894314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:51, skipping insertion in model container [2019-09-16 17:04:51,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:51" (3/3) ... [2019-09-16 17:04:51,574 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-09-16 17:04:51,585 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:51,593 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:51,613 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:51,651 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:51,651 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:51,664 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:51,665 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:51,665 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:51,665 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:51,665 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:51,665 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-09-16 17:04:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:51,695 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:51,696 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:51,699 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:51,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:51,704 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2019-09-16 17:04:51,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:51,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:51,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:51,878 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-16 17:04:51,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:51,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:51,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:51,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:51,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:51,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,906 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-09-16 17:04:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:51,964 INFO L93 Difference]: Finished difference Result 74 states and 125 transitions. [2019-09-16 17:04:51,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:51,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,978 INFO L225 Difference]: With dead ends: 74 [2019-09-16 17:04:51,979 INFO L226 Difference]: Without dead ends: 66 [2019-09-16 17:04:51,981 INFO L636 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-16 17:04:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-16 17:04:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-09-16 17:04:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-16 17:04:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2019-09-16 17:04:52,022 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2019-09-16 17:04:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,022 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2019-09-16 17:04:52,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,023 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2019-09-16 17:04:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:52,024 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,024 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,024 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2019-09-16 17:04:52,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,099 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-16 17:04:52,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,103 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2019-09-16 17:04:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,128 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2019-09-16 17:04:52,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,131 INFO L225 Difference]: With dead ends: 66 [2019-09-16 17:04:52,131 INFO L226 Difference]: Without dead ends: 66 [2019-09-16 17:04:52,132 INFO L636 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-16 17:04:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-16 17:04:52,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-16 17:04:52,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-16 17:04:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2019-09-16 17:04:52,145 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2019-09-16 17:04:52,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,146 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2019-09-16 17:04:52,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2019-09-16 17:04:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:52,149 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,151 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,151 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,152 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2019-09-16 17:04:52,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,208 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-16 17:04:52,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,213 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2019-09-16 17:04:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,254 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2019-09-16 17:04:52,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,257 INFO L225 Difference]: With dead ends: 69 [2019-09-16 17:04:52,257 INFO L226 Difference]: Without dead ends: 69 [2019-09-16 17:04:52,258 INFO L636 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-16 17:04:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-16 17:04:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-16 17:04:52,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-16 17:04:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2019-09-16 17:04:52,270 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2019-09-16 17:04:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,272 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2019-09-16 17:04:52,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2019-09-16 17:04:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:52,274 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,274 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,274 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,275 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2019-09-16 17:04:52,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:52,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,363 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2019-09-16 17:04:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,403 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2019-09-16 17:04:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,406 INFO L225 Difference]: With dead ends: 122 [2019-09-16 17:04:52,407 INFO L226 Difference]: Without dead ends: 122 [2019-09-16 17:04:52,410 INFO L636 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-16 17:04:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-16 17:04:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-09-16 17:04:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-16 17:04:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2019-09-16 17:04:52,435 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2019-09-16 17:04:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,435 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2019-09-16 17:04:52,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2019-09-16 17:04:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:52,438 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,438 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,439 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2019-09-16 17:04:52,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:52,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,482 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2019-09-16 17:04:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,509 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2019-09-16 17:04:52,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,511 INFO L225 Difference]: With dead ends: 124 [2019-09-16 17:04:52,512 INFO L226 Difference]: Without dead ends: 124 [2019-09-16 17:04:52,512 INFO L636 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-16 17:04:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-16 17:04:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-09-16 17:04:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-16 17:04:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2019-09-16 17:04:52,523 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2019-09-16 17:04:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,523 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2019-09-16 17:04:52,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,524 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2019-09-16 17:04:52,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:52,525 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,525 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,526 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2019-09-16 17:04:52,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,570 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-16 17:04:52,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,572 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2019-09-16 17:04:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,610 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2019-09-16 17:04:52,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,612 INFO L225 Difference]: With dead ends: 126 [2019-09-16 17:04:52,612 INFO L226 Difference]: Without dead ends: 126 [2019-09-16 17:04:52,613 INFO L636 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-16 17:04:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-16 17:04:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-09-16 17:04:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-16 17:04:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-09-16 17:04:52,623 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2019-09-16 17:04:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,624 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-09-16 17:04:52,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-09-16 17:04:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:52,625 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,626 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,626 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2019-09-16 17:04:52,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,667 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-16 17:04:52,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,669 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2019-09-16 17:04:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,694 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2019-09-16 17:04:52,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,697 INFO L225 Difference]: With dead ends: 226 [2019-09-16 17:04:52,697 INFO L226 Difference]: Without dead ends: 226 [2019-09-16 17:04:52,697 INFO L636 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-16 17:04:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-16 17:04:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2019-09-16 17:04:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-16 17:04:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2019-09-16 17:04:52,709 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2019-09-16 17:04:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,709 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2019-09-16 17:04:52,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2019-09-16 17:04:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:52,711 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,711 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,712 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2019-09-16 17:04:52,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,777 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-16 17:04:52,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,780 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2019-09-16 17:04:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,811 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2019-09-16 17:04:52,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,814 INFO L225 Difference]: With dead ends: 234 [2019-09-16 17:04:52,815 INFO L226 Difference]: Without dead ends: 234 [2019-09-16 17:04:52,816 INFO L636 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-16 17:04:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-16 17:04:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-09-16 17:04:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-16 17:04:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2019-09-16 17:04:52,840 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2019-09-16 17:04:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,841 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2019-09-16 17:04:52,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2019-09-16 17:04:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:52,843 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,847 INFO L407 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] [2019-09-16 17:04:52,847 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2019-09-16 17:04:52,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,925 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-16 17:04:52,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,928 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2019-09-16 17:04:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,949 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2019-09-16 17:04:52,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,951 INFO L225 Difference]: With dead ends: 238 [2019-09-16 17:04:52,953 INFO L226 Difference]: Without dead ends: 238 [2019-09-16 17:04:52,953 INFO L636 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-16 17:04:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-16 17:04:52,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-09-16 17:04:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-16 17:04:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2019-09-16 17:04:52,962 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2019-09-16 17:04:52,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,962 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2019-09-16 17:04:52,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2019-09-16 17:04:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:52,968 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,969 INFO L407 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] [2019-09-16 17:04:52,969 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2019-09-16 17:04:52,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:53,019 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-16 17:04:53,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:53,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:53,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:53,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:53,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:53,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:53,023 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2019-09-16 17:04:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,041 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2019-09-16 17:04:53,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:53,045 INFO L225 Difference]: With dead ends: 426 [2019-09-16 17:04:53,045 INFO L226 Difference]: Without dead ends: 426 [2019-09-16 17:04:53,046 INFO L636 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-16 17:04:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-09-16 17:04:53,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2019-09-16 17:04:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-16 17:04:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-09-16 17:04:53,063 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2019-09-16 17:04:53,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:53,069 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-09-16 17:04:53,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:53,069 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-09-16 17:04:53,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:53,072 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:53,072 INFO L407 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] [2019-09-16 17:04:53,072 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:53,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2019-09-16 17:04:53,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:53,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:53,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:53,105 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-16 17:04:53,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:53,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:53,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:53,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:53,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:53,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:53,107 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2019-09-16 17:04:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,128 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2019-09-16 17:04:53,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:53,131 INFO L225 Difference]: With dead ends: 450 [2019-09-16 17:04:53,132 INFO L226 Difference]: Without dead ends: 450 [2019-09-16 17:04:53,132 INFO L636 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-16 17:04:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-16 17:04:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-09-16 17:04:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-16 17:04:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2019-09-16 17:04:53,147 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2019-09-16 17:04:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:53,147 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2019-09-16 17:04:53,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2019-09-16 17:04:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:53,148 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:53,149 INFO L407 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] [2019-09-16 17:04:53,149 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:53,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:53,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2019-09-16 17:04:53,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:53,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:53,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:53,189 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-16 17:04:53,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:53,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:53,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:53,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:53,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:53,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:53,191 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2019-09-16 17:04:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,208 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2019-09-16 17:04:53,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:53,211 INFO L225 Difference]: With dead ends: 458 [2019-09-16 17:04:53,212 INFO L226 Difference]: Without dead ends: 458 [2019-09-16 17:04:53,212 INFO L636 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-16 17:04:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-16 17:04:53,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2019-09-16 17:04:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-16 17:04:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2019-09-16 17:04:53,225 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2019-09-16 17:04:53,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:53,225 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2019-09-16 17:04:53,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2019-09-16 17:04:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:53,228 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:53,228 INFO L407 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] [2019-09-16 17:04:53,228 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:53,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:53,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2019-09-16 17:04:53,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:53,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:53,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:53,264 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-16 17:04:53,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:53,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:53,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:53,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:53,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:53,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:53,267 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2019-09-16 17:04:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,286 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2019-09-16 17:04:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:53,291 INFO L225 Difference]: With dead ends: 810 [2019-09-16 17:04:53,291 INFO L226 Difference]: Without dead ends: 810 [2019-09-16 17:04:53,291 INFO L636 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-16 17:04:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-09-16 17:04:53,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2019-09-16 17:04:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-16 17:04:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2019-09-16 17:04:53,309 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2019-09-16 17:04:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:53,310 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2019-09-16 17:04:53,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2019-09-16 17:04:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:53,312 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:53,312 INFO L407 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] [2019-09-16 17:04:53,312 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:53,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:53,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2019-09-16 17:04:53,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:53,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:53,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:53,355 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-16 17:04:53,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:53,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:53,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:53,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:53,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:53,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:53,357 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2019-09-16 17:04:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,376 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2019-09-16 17:04:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:53,382 INFO L225 Difference]: With dead ends: 874 [2019-09-16 17:04:53,382 INFO L226 Difference]: Without dead ends: 874 [2019-09-16 17:04:53,382 INFO L636 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-16 17:04:53,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-16 17:04:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2019-09-16 17:04:53,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-09-16 17:04:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2019-09-16 17:04:53,404 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2019-09-16 17:04:53,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:53,404 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2019-09-16 17:04:53,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2019-09-16 17:04:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:53,406 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:53,406 INFO L407 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] [2019-09-16 17:04:53,407 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:53,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:53,407 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2019-09-16 17:04:53,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:53,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:53,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:53,425 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-16 17:04:53,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:53,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:53,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:53,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:53,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:53,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:53,427 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2019-09-16 17:04:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,444 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2019-09-16 17:04:53,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:53,449 INFO L225 Difference]: With dead ends: 890 [2019-09-16 17:04:53,449 INFO L226 Difference]: Without dead ends: 890 [2019-09-16 17:04:53,450 INFO L636 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-16 17:04:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-09-16 17:04:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2019-09-16 17:04:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-09-16 17:04:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2019-09-16 17:04:53,470 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2019-09-16 17:04:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:53,471 INFO L475 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2019-09-16 17:04:53,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2019-09-16 17:04:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:53,472 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:53,473 INFO L407 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] [2019-09-16 17:04:53,473 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:53,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:53,473 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2019-09-16 17:04:53,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:53,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:53,491 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-16 17:04:53,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:53,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:53,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:53,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:53,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:53,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:53,493 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2019-09-16 17:04:53,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,513 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2019-09-16 17:04:53,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:53,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:53,521 INFO L225 Difference]: With dead ends: 1546 [2019-09-16 17:04:53,521 INFO L226 Difference]: Without dead ends: 1546 [2019-09-16 17:04:53,521 INFO L636 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-16 17:04:53,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-09-16 17:04:53,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2019-09-16 17:04:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-09-16 17:04:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2019-09-16 17:04:53,554 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2019-09-16 17:04:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:53,555 INFO L475 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2019-09-16 17:04:53,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2019-09-16 17:04:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:53,558 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:53,558 INFO L407 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] [2019-09-16 17:04:53,558 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:53,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:53,559 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2019-09-16 17:04:53,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:53,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:53,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:53,583 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-16 17:04:53,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:53,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:53,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:53,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:53,585 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2019-09-16 17:04:53,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,609 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2019-09-16 17:04:53,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:53,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:53,618 INFO L225 Difference]: With dead ends: 1706 [2019-09-16 17:04:53,618 INFO L226 Difference]: Without dead ends: 1706 [2019-09-16 17:04:53,619 INFO L636 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-16 17:04:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-09-16 17:04:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2019-09-16 17:04:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-09-16 17:04:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2019-09-16 17:04:53,667 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2019-09-16 17:04:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:53,667 INFO L475 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2019-09-16 17:04:53,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2019-09-16 17:04:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:53,685 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:53,686 INFO L407 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] [2019-09-16 17:04:53,686 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:53,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:53,687 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2019-09-16 17:04:53,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:53,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:53,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:53,704 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-16 17:04:53,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:53,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:53,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:53,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:53,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:53,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:53,706 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2019-09-16 17:04:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,728 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2019-09-16 17:04:53,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:53,736 INFO L225 Difference]: With dead ends: 1738 [2019-09-16 17:04:53,736 INFO L226 Difference]: Without dead ends: 1738 [2019-09-16 17:04:53,737 INFO L636 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-16 17:04:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-09-16 17:04:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2019-09-16 17:04:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-09-16 17:04:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2019-09-16 17:04:53,774 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2019-09-16 17:04:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:53,775 INFO L475 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2019-09-16 17:04:53,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2019-09-16 17:04:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:53,777 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:53,778 INFO L407 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] [2019-09-16 17:04:53,778 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:53,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:53,778 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2019-09-16 17:04:53,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:53,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:53,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:53,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:53,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:53,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:53,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:53,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:53,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:53,799 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2019-09-16 17:04:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,826 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2019-09-16 17:04:53,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:53,840 INFO L225 Difference]: With dead ends: 2954 [2019-09-16 17:04:53,841 INFO L226 Difference]: Without dead ends: 2954 [2019-09-16 17:04:53,841 INFO L636 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-16 17:04:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-09-16 17:04:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2019-09-16 17:04:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-09-16 17:04:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2019-09-16 17:04:53,902 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2019-09-16 17:04:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:53,902 INFO L475 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2019-09-16 17:04:53,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2019-09-16 17:04:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:53,907 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:53,907 INFO L407 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] [2019-09-16 17:04:53,907 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:53,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:53,908 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2019-09-16 17:04:53,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:53,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:53,940 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-16 17:04:53,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:53,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:53,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:53,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:53,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:53,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:53,942 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2019-09-16 17:04:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,984 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2019-09-16 17:04:53,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:54,000 INFO L225 Difference]: With dead ends: 3338 [2019-09-16 17:04:54,000 INFO L226 Difference]: Without dead ends: 3338 [2019-09-16 17:04:54,001 INFO L636 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-16 17:04:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-09-16 17:04:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2019-09-16 17:04:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-09-16 17:04:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2019-09-16 17:04:54,113 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2019-09-16 17:04:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:54,114 INFO L475 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2019-09-16 17:04:54,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2019-09-16 17:04:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 17:04:54,119 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:54,119 INFO L407 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] [2019-09-16 17:04:54,119 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:54,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:54,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2019-09-16 17:04:54,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:54,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:54,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:54,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:54,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:54,143 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-16 17:04:54,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:54,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:54,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:54,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:54,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:54,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:54,145 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2019-09-16 17:04:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:54,186 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2019-09-16 17:04:54,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:54,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 17:04:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:54,204 INFO L225 Difference]: With dead ends: 3402 [2019-09-16 17:04:54,205 INFO L226 Difference]: Without dead ends: 3402 [2019-09-16 17:04:54,205 INFO L636 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-16 17:04:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-09-16 17:04:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2019-09-16 17:04:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2019-09-16 17:04:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2019-09-16 17:04:54,306 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2019-09-16 17:04:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:54,306 INFO L475 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2019-09-16 17:04:54,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2019-09-16 17:04:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 17:04:54,312 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:54,312 INFO L407 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] [2019-09-16 17:04:54,312 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:54,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:54,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2019-09-16 17:04:54,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:54,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:54,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:54,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:54,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:54,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:54,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:54,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:54,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:54,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:54,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:54,346 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2019-09-16 17:04:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:54,396 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2019-09-16 17:04:54,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:54,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 17:04:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:54,455 INFO L225 Difference]: With dead ends: 6538 [2019-09-16 17:04:54,455 INFO L226 Difference]: Without dead ends: 6538 [2019-09-16 17:04:54,455 INFO L636 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-16 17:04:54,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-09-16 17:04:54,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2019-09-16 17:04:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-09-16 17:04:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2019-09-16 17:04:54,621 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2019-09-16 17:04:54,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:54,622 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2019-09-16 17:04:54,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2019-09-16 17:04:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 17:04:54,631 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:54,631 INFO L407 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] [2019-09-16 17:04:54,631 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:54,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2019-09-16 17:04:54,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:54,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:54,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:54,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:54,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:54,655 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-16 17:04:54,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:54,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:54,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:54,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:54,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:54,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:54,657 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2019-09-16 17:04:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:54,693 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2019-09-16 17:04:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:54,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 17:04:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:54,710 INFO L225 Difference]: With dead ends: 7050 [2019-09-16 17:04:54,710 INFO L226 Difference]: Without dead ends: 7050 [2019-09-16 17:04:54,710 INFO L636 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-16 17:04:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-09-16 17:04:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2019-09-16 17:04:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-09-16 17:04:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2019-09-16 17:04:54,855 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2019-09-16 17:04:54,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:54,856 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2019-09-16 17:04:54,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2019-09-16 17:04:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:04:54,866 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:54,866 INFO L407 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] [2019-09-16 17:04:54,866 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:54,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:54,867 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2019-09-16 17:04:54,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:54,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:54,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:54,884 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-16 17:04:54,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:54,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:54,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:54,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:54,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:54,886 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2019-09-16 17:04:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:54,933 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2019-09-16 17:04:54,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:54,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 17:04:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:54,957 INFO L225 Difference]: With dead ends: 10632 [2019-09-16 17:04:54,957 INFO L226 Difference]: Without dead ends: 10632 [2019-09-16 17:04:54,958 INFO L636 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-16 17:04:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2019-09-16 17:04:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2019-09-16 17:04:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2019-09-16 17:04:55,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2019-09-16 17:04:55,170 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2019-09-16 17:04:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:55,171 INFO L475 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2019-09-16 17:04:55,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2019-09-16 17:04:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:04:55,189 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:55,189 INFO L407 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] [2019-09-16 17:04:55,189 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:55,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2019-09-16 17:04:55,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:55,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:55,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:55,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:55,208 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-16 17:04:55,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:55,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:55,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:55,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:55,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:55,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:55,210 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2019-09-16 17:04:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:55,259 INFO L93 Difference]: Finished difference Result 12678 states and 13829 transitions. [2019-09-16 17:04:55,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:55,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 17:04:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:55,260 INFO L225 Difference]: With dead ends: 12678 [2019-09-16 17:04:55,260 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:04:55,261 INFO L636 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-16 17:04:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:04:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:04:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:04:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:04:55,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-09-16 17:04:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:55,262 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:04:55,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:04:55,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:04:55,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:04:55 BoogieIcfgContainer [2019-09-16 17:04:55,268 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:04:55,271 INFO L168 Benchmark]: Toolchain (without parser) took 4488.90 ms. Allocated memory was 133.7 MB in the beginning and 329.3 MB in the end (delta: 195.6 MB). Free memory was 88.9 MB in the beginning and 209.8 MB in the end (delta: -120.8 MB). Peak memory consumption was 74.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:55,272 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:04:55,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.50 ms. Allocated memory is still 133.7 MB. Free memory was 88.7 MB in the beginning and 78.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:55,273 INFO L168 Benchmark]: Boogie Preprocessor took 123.67 ms. Allocated memory was 133.7 MB in the beginning and 197.7 MB in the end (delta: 64.0 MB). Free memory was 78.3 MB in the beginning and 173.7 MB in the end (delta: -95.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:55,274 INFO L168 Benchmark]: RCFGBuilder took 380.05 ms. Allocated memory is still 197.7 MB. Free memory was 173.7 MB in the beginning and 155.4 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:55,275 INFO L168 Benchmark]: TraceAbstraction took 3702.29 ms. Allocated memory was 197.7 MB in the beginning and 329.3 MB in the end (delta: 131.6 MB). Free memory was 155.4 MB in the beginning and 209.8 MB in the end (delta: -54.4 MB). Peak memory consumption was 77.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:55,282 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 107.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 274.50 ms. Allocated memory is still 133.7 MB. Free memory was 88.7 MB in the beginning and 78.3 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.67 ms. Allocated memory was 133.7 MB in the beginning and 197.7 MB in the end (delta: 64.0 MB). Free memory was 78.3 MB in the beginning and 173.7 MB in the end (delta: -95.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 380.05 ms. Allocated memory is still 197.7 MB. Free memory was 173.7 MB in the beginning and 155.4 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3702.29 ms. Allocated memory was 197.7 MB in the beginning and 329.3 MB in the end (delta: 131.6 MB). Free memory was 155.4 MB in the beginning and 209.8 MB in the end (delta: -54.4 MB). Peak memory consumption was 77.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. SAFE Result, 3.6s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...