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_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:47,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:47,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:47,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:47,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:47,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:47,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:47,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:47,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:47,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:47,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:47,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:47,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:47,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:47,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:47,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:47,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:47,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:47,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:47,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:47,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:47,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:47,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:47,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:47,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:47,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:47,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:47,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:47,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:47,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:47,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:47,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:47,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:47,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:47,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:47,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:47,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:47,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:47,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:47,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:47,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:47,707 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-20 13:26:47,723 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:47,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:47,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:47,725 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:47,725 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:47,725 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:47,726 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:47,726 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:47,726 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:47,726 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:47,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:47,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:47,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:47,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:47,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:47,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:47,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:47,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:47,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:47,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:47,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:47,729 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:47,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:47,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:47,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:47,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:47,730 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:47,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:47,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:47,731 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:47,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:47,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:47,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:47,778 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:47,779 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:47,779 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2019-09-20 13:26:47,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfaad8c76/f243b48c97b84141b16d6c4612ef5082/FLAG7b2ddebf4 [2019-09-20 13:26:48,354 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:48,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2019-09-20 13:26:48,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfaad8c76/f243b48c97b84141b16d6c4612ef5082/FLAG7b2ddebf4 [2019-09-20 13:26:48,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfaad8c76/f243b48c97b84141b16d6c4612ef5082 [2019-09-20 13:26:48,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:48,637 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:48,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:48,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:48,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:48,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:48,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2a1578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48, skipping insertion in model container [2019-09-20 13:26:48,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:48,655 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:48,690 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:48,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:48,934 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:48,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:48,984 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:48,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48 WrapperNode [2019-09-20 13:26:48,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:48,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:48,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:48,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:49,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:49,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:49,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:49,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:49,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:49,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:49,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... [2019-09-20 13:26:49,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:49,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:49,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:49,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:49,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:49,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:49,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:49,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:49,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:49,678 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:49,678 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:49,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:49 BoogieIcfgContainer [2019-09-20 13:26:49,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:49,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:49,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:49,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:49,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:48" (1/3) ... [2019-09-20 13:26:49,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26947d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:49, skipping insertion in model container [2019-09-20 13:26:49,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:48" (2/3) ... [2019-09-20 13:26:49,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26947d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:49, skipping insertion in model container [2019-09-20 13:26:49,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:49" (3/3) ... [2019-09-20 13:26:49,696 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-09-20 13:26:49,714 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:49,728 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:49,754 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:49,786 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:49,786 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:49,787 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:49,787 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:49,787 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:49,788 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:49,788 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:49,788 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-09-20 13:26:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:49,820 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:49,821 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-20 13:26:49,824 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:49,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2019-09-20 13:26:49,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:49,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:49,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,113 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-09-20 13:26:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,168 INFO L93 Difference]: Finished difference Result 92 states and 161 transitions. [2019-09-20 13:26:50,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,184 INFO L225 Difference]: With dead ends: 92 [2019-09-20 13:26:50,184 INFO L226 Difference]: Without dead ends: 84 [2019-09-20 13:26:50,186 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-20 13:26:50,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-20 13:26:50,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-09-20 13:26:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-20 13:26:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2019-09-20 13:26:50,245 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2019-09-20 13:26:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,246 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2019-09-20 13:26:50,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,247 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2019-09-20 13:26:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:50,248 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,248 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-20 13:26:50,250 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2019-09-20 13:26:50,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,335 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-20 13:26:50,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,340 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2019-09-20 13:26:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,370 INFO L93 Difference]: Finished difference Result 84 states and 150 transitions. [2019-09-20 13:26:50,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,373 INFO L225 Difference]: With dead ends: 84 [2019-09-20 13:26:50,373 INFO L226 Difference]: Without dead ends: 84 [2019-09-20 13:26:50,374 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-20 13:26:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-20 13:26:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-09-20 13:26:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-20 13:26:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2019-09-20 13:26:50,385 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2019-09-20 13:26:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,386 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2019-09-20 13:26:50,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2019-09-20 13:26:50,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:50,387 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,388 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-20 13:26:50,388 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2019-09-20 13:26:50,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,444 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-20 13:26:50,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,448 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2019-09-20 13:26:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,482 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2019-09-20 13:26:50,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,486 INFO L225 Difference]: With dead ends: 87 [2019-09-20 13:26:50,486 INFO L226 Difference]: Without dead ends: 87 [2019-09-20 13:26:50,486 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-20 13:26:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-20 13:26:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-09-20 13:26:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-20 13:26:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2019-09-20 13:26:50,507 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2019-09-20 13:26:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,507 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2019-09-20 13:26:50,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2019-09-20 13:26:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:50,509 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,509 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-20 13:26:50,509 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,510 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2019-09-20 13:26:50,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,557 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-20 13:26:50,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,559 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2019-09-20 13:26:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,583 INFO L93 Difference]: Finished difference Result 158 states and 285 transitions. [2019-09-20 13:26:50,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,585 INFO L225 Difference]: With dead ends: 158 [2019-09-20 13:26:50,586 INFO L226 Difference]: Without dead ends: 158 [2019-09-20 13:26:50,586 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-20 13:26:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-20 13:26:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2019-09-20 13:26:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-20 13:26:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2019-09-20 13:26:50,597 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2019-09-20 13:26:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,597 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2019-09-20 13:26:50,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2019-09-20 13:26:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:50,599 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,599 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-20 13:26:50,599 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,600 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2019-09-20 13:26:50,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,641 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-20 13:26:50,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,643 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2019-09-20 13:26:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,688 INFO L93 Difference]: Finished difference Result 160 states and 283 transitions. [2019-09-20 13:26:50,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:50,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,690 INFO L225 Difference]: With dead ends: 160 [2019-09-20 13:26:50,691 INFO L226 Difference]: Without dead ends: 160 [2019-09-20 13:26:50,691 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-20 13:26:50,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-20 13:26:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-09-20 13:26:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-20 13:26:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2019-09-20 13:26:50,721 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2019-09-20 13:26:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,722 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2019-09-20 13:26:50,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2019-09-20 13:26:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:50,725 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,726 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-20 13:26:50,726 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,727 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2019-09-20 13:26:50,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,832 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-20 13:26:50,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,834 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2019-09-20 13:26:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,859 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2019-09-20 13:26:50,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,861 INFO L225 Difference]: With dead ends: 162 [2019-09-20 13:26:50,861 INFO L226 Difference]: Without dead ends: 162 [2019-09-20 13:26:50,862 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-20 13:26:50,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-20 13:26:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-09-20 13:26:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-20 13:26:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2019-09-20 13:26:50,872 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2019-09-20 13:26:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,873 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2019-09-20 13:26:50,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2019-09-20 13:26:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:50,875 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,875 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-20 13:26:50,875 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,876 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2019-09-20 13:26:50,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,923 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-20 13:26:50,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,924 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,925 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2019-09-20 13:26:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,950 INFO L93 Difference]: Finished difference Result 298 states and 531 transitions. [2019-09-20 13:26:50,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:50,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,953 INFO L225 Difference]: With dead ends: 298 [2019-09-20 13:26:50,953 INFO L226 Difference]: Without dead ends: 298 [2019-09-20 13:26:50,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-20 13:26:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-20 13:26:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2019-09-20 13:26:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-20 13:26:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-09-20 13:26:50,964 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2019-09-20 13:26:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,964 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-09-20 13:26:50,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-09-20 13:26:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:50,967 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,967 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-20 13:26:50,967 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2019-09-20 13:26:50,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,009 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-20 13:26:51,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,014 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2019-09-20 13:26:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,049 INFO L93 Difference]: Finished difference Result 306 states and 531 transitions. [2019-09-20 13:26:51,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,054 INFO L225 Difference]: With dead ends: 306 [2019-09-20 13:26:51,054 INFO L226 Difference]: Without dead ends: 306 [2019-09-20 13:26:51,056 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-20 13:26:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-20 13:26:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-20 13:26:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-20 13:26:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2019-09-20 13:26:51,066 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2019-09-20 13:26:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,067 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2019-09-20 13:26:51,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2019-09-20 13:26:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:51,076 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,076 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-20 13:26:51,076 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2019-09-20 13:26:51,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,123 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-20 13:26:51,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,125 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2019-09-20 13:26:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,140 INFO L93 Difference]: Finished difference Result 310 states and 531 transitions. [2019-09-20 13:26:51,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,142 INFO L225 Difference]: With dead ends: 310 [2019-09-20 13:26:51,143 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:26:51,143 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-20 13:26:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:26:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-09-20 13:26:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-20 13:26:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2019-09-20 13:26:51,152 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2019-09-20 13:26:51,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,152 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2019-09-20 13:26:51,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2019-09-20 13:26:51,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:51,154 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,154 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-20 13:26:51,154 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,155 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2019-09-20 13:26:51,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,178 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-20 13:26:51,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,180 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2019-09-20 13:26:51,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,200 INFO L93 Difference]: Finished difference Result 570 states and 991 transitions. [2019-09-20 13:26:51,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:51,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,204 INFO L225 Difference]: With dead ends: 570 [2019-09-20 13:26:51,204 INFO L226 Difference]: Without dead ends: 570 [2019-09-20 13:26:51,204 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-20 13:26:51,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-20 13:26:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2019-09-20 13:26:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-20 13:26:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2019-09-20 13:26:51,218 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2019-09-20 13:26:51,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,218 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2019-09-20 13:26:51,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2019-09-20 13:26:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:51,220 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,220 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-20 13:26:51,220 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2019-09-20 13:26:51,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,258 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-20 13:26:51,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,260 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2019-09-20 13:26:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,284 INFO L93 Difference]: Finished difference Result 594 states and 999 transitions. [2019-09-20 13:26:51,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,288 INFO L225 Difference]: With dead ends: 594 [2019-09-20 13:26:51,288 INFO L226 Difference]: Without dead ends: 594 [2019-09-20 13:26:51,289 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-20 13:26:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-20 13:26:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2019-09-20 13:26:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-20 13:26:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2019-09-20 13:26:51,305 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2019-09-20 13:26:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,305 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2019-09-20 13:26:51,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2019-09-20 13:26:51,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:51,307 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,307 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-20 13:26:51,307 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,308 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2019-09-20 13:26:51,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,339 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-20 13:26:51,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,342 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2019-09-20 13:26:51,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,357 INFO L93 Difference]: Finished difference Result 602 states and 999 transitions. [2019-09-20 13:26:51,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,362 INFO L225 Difference]: With dead ends: 602 [2019-09-20 13:26:51,362 INFO L226 Difference]: Without dead ends: 602 [2019-09-20 13:26:51,362 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-20 13:26:51,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-20 13:26:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-09-20 13:26:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-20 13:26:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2019-09-20 13:26:51,377 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2019-09-20 13:26:51,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,377 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2019-09-20 13:26:51,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2019-09-20 13:26:51,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:51,379 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,379 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-20 13:26:51,379 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2019-09-20 13:26:51,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,409 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-20 13:26:51,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,411 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2019-09-20 13:26:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,430 INFO L93 Difference]: Finished difference Result 1098 states and 1847 transitions. [2019-09-20 13:26:51,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:51,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,436 INFO L225 Difference]: With dead ends: 1098 [2019-09-20 13:26:51,437 INFO L226 Difference]: Without dead ends: 1098 [2019-09-20 13:26:51,437 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-20 13:26:51,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-09-20 13:26:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2019-09-20 13:26:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-09-20 13:26:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2019-09-20 13:26:51,461 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2019-09-20 13:26:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,461 INFO L475 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2019-09-20 13:26:51,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2019-09-20 13:26:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:51,463 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,463 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-20 13:26:51,463 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2019-09-20 13:26:51,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,482 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-20 13:26:51,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,484 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2019-09-20 13:26:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,505 INFO L93 Difference]: Finished difference Result 1162 states and 1879 transitions. [2019-09-20 13:26:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,511 INFO L225 Difference]: With dead ends: 1162 [2019-09-20 13:26:51,511 INFO L226 Difference]: Without dead ends: 1162 [2019-09-20 13:26:51,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-20 13:26:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-09-20 13:26:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2019-09-20 13:26:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-09-20 13:26:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2019-09-20 13:26:51,539 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2019-09-20 13:26:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,539 INFO L475 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2019-09-20 13:26:51,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2019-09-20 13:26:51,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:51,541 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,542 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-20 13:26:51,542 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,542 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2019-09-20 13:26:51,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,563 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-20 13:26:51,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,564 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2019-09-20 13:26:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,583 INFO L93 Difference]: Finished difference Result 1178 states and 1879 transitions. [2019-09-20 13:26:51,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,589 INFO L225 Difference]: With dead ends: 1178 [2019-09-20 13:26:51,590 INFO L226 Difference]: Without dead ends: 1178 [2019-09-20 13:26:51,590 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-20 13:26:51,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-09-20 13:26:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2019-09-20 13:26:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2019-09-20 13:26:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2019-09-20 13:26:51,617 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2019-09-20 13:26:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,617 INFO L475 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2019-09-20 13:26:51,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2019-09-20 13:26:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:51,619 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,619 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-20 13:26:51,619 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,620 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2019-09-20 13:26:51,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,641 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-20 13:26:51,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,643 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2019-09-20 13:26:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,669 INFO L93 Difference]: Finished difference Result 2122 states and 3431 transitions. [2019-09-20 13:26:51,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,680 INFO L225 Difference]: With dead ends: 2122 [2019-09-20 13:26:51,680 INFO L226 Difference]: Without dead ends: 2122 [2019-09-20 13:26:51,681 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-20 13:26:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-09-20 13:26:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2019-09-20 13:26:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-09-20 13:26:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2019-09-20 13:26:51,741 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2019-09-20 13:26:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,741 INFO L475 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2019-09-20 13:26:51,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2019-09-20 13:26:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:51,744 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,744 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-20 13:26:51,745 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2019-09-20 13:26:51,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,762 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-20 13:26:51,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,764 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2019-09-20 13:26:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,789 INFO L93 Difference]: Finished difference Result 2282 states and 3527 transitions. [2019-09-20 13:26:51,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,801 INFO L225 Difference]: With dead ends: 2282 [2019-09-20 13:26:51,801 INFO L226 Difference]: Without dead ends: 2282 [2019-09-20 13:26:51,802 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-20 13:26:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-09-20 13:26:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2019-09-20 13:26:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-09-20 13:26:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2019-09-20 13:26:51,853 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2019-09-20 13:26:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,853 INFO L475 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2019-09-20 13:26:51,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2019-09-20 13:26:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:51,856 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,856 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, 1] [2019-09-20 13:26:51,857 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2019-09-20 13:26:51,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,875 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-20 13:26:51,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,877 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2019-09-20 13:26:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,905 INFO L93 Difference]: Finished difference Result 2314 states and 3527 transitions. [2019-09-20 13:26:51,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,922 INFO L225 Difference]: With dead ends: 2314 [2019-09-20 13:26:51,922 INFO L226 Difference]: Without dead ends: 2314 [2019-09-20 13:26:51,923 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-20 13:26:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-09-20 13:26:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2019-09-20 13:26:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-09-20 13:26:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2019-09-20 13:26:51,992 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2019-09-20 13:26:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,993 INFO L475 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2019-09-20 13:26:51,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2019-09-20 13:26:51,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:51,997 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,998 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, 1] [2019-09-20 13:26:51,998 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2019-09-20 13:26:51,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,024 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-20 13:26:52,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,027 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2019-09-20 13:26:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,075 INFO L93 Difference]: Finished difference Result 4106 states and 6343 transitions. [2019-09-20 13:26:52,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,102 INFO L225 Difference]: With dead ends: 4106 [2019-09-20 13:26:52,102 INFO L226 Difference]: Without dead ends: 4106 [2019-09-20 13:26:52,103 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-20 13:26:52,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-09-20 13:26:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2019-09-20 13:26:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-09-20 13:26:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2019-09-20 13:26:52,201 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2019-09-20 13:26:52,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,202 INFO L475 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2019-09-20 13:26:52,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2019-09-20 13:26:52,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:52,208 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,209 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, 1] [2019-09-20 13:26:52,209 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2019-09-20 13:26:52,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,233 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-20 13:26:52,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,236 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2019-09-20 13:26:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,282 INFO L93 Difference]: Finished difference Result 4490 states and 6599 transitions. [2019-09-20 13:26:52,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:52,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,311 INFO L225 Difference]: With dead ends: 4490 [2019-09-20 13:26:52,311 INFO L226 Difference]: Without dead ends: 4490 [2019-09-20 13:26:52,312 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-20 13:26:52,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-09-20 13:26:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2019-09-20 13:26:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2019-09-20 13:26:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2019-09-20 13:26:52,445 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2019-09-20 13:26:52,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,445 INFO L475 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2019-09-20 13:26:52,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2019-09-20 13:26:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:52,453 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,453 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, 1, 1] [2019-09-20 13:26:52,454 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,454 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2019-09-20 13:26:52,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,479 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2019-09-20 13:26:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,522 INFO L93 Difference]: Finished difference Result 4554 states and 6599 transitions. [2019-09-20 13:26:52,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,587 INFO L225 Difference]: With dead ends: 4554 [2019-09-20 13:26:52,588 INFO L226 Difference]: Without dead ends: 4554 [2019-09-20 13:26:52,588 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-20 13:26:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2019-09-20 13:26:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2019-09-20 13:26:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2019-09-20 13:26:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2019-09-20 13:26:52,681 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2019-09-20 13:26:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,681 INFO L475 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2019-09-20 13:26:52,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2019-09-20 13:26:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:52,687 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,687 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, 1, 1] [2019-09-20 13:26:52,687 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,688 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2019-09-20 13:26:52,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,707 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-20 13:26:52,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,709 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2019-09-20 13:26:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,759 INFO L93 Difference]: Finished difference Result 8842 states and 12423 transitions. [2019-09-20 13:26:52,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,781 INFO L225 Difference]: With dead ends: 8842 [2019-09-20 13:26:52,781 INFO L226 Difference]: Without dead ends: 8842 [2019-09-20 13:26:52,781 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-20 13:26:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2019-09-20 13:26:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2019-09-20 13:26:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-09-20 13:26:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2019-09-20 13:26:52,968 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2019-09-20 13:26:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,968 INFO L475 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2019-09-20 13:26:52,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2019-09-20 13:26:52,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:52,983 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,984 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, 1, 1] [2019-09-20 13:26:52,984 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,984 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2019-09-20 13:26:52,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,014 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-20 13:26:53,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,017 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2019-09-20 13:26:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,062 INFO L93 Difference]: Finished difference Result 10122 states and 14599 transitions. [2019-09-20 13:26:53,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,087 INFO L225 Difference]: With dead ends: 10122 [2019-09-20 13:26:53,088 INFO L226 Difference]: Without dead ends: 10122 [2019-09-20 13:26:53,088 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-20 13:26:53,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2019-09-20 13:26:53,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2019-09-20 13:26:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-09-20 13:26:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2019-09-20 13:26:53,330 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2019-09-20 13:26:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,330 INFO L475 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2019-09-20 13:26:53,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2019-09-20 13:26:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:53,341 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,341 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, 1, 1, 1] [2019-09-20 13:26:53,342 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2019-09-20 13:26:53,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,373 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-20 13:26:53,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,375 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2019-09-20 13:26:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,435 INFO L93 Difference]: Finished difference Result 15242 states and 21383 transitions. [2019-09-20 13:26:53,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:53,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,468 INFO L225 Difference]: With dead ends: 15242 [2019-09-20 13:26:53,468 INFO L226 Difference]: Without dead ends: 15242 [2019-09-20 13:26:53,475 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-20 13:26:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2019-09-20 13:26:53,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2019-09-20 13:26:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-09-20 13:26:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2019-09-20 13:26:53,706 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2019-09-20 13:26:53,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,706 INFO L475 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2019-09-20 13:26:53,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2019-09-20 13:26:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:53,728 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,728 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, 1, 1, 1] [2019-09-20 13:26:53,728 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,728 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2019-09-20 13:26:53,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,753 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-20 13:26:53,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,755 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2019-09-20 13:26:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,827 INFO L93 Difference]: Finished difference Result 17290 states and 23047 transitions. [2019-09-20 13:26:53,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:53,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,862 INFO L225 Difference]: With dead ends: 17290 [2019-09-20 13:26:53,862 INFO L226 Difference]: Without dead ends: 17290 [2019-09-20 13:26:53,862 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-20 13:26:53,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2019-09-20 13:26:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2019-09-20 13:26:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2019-09-20 13:26:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2019-09-20 13:26:54,202 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2019-09-20 13:26:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,202 INFO L475 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2019-09-20 13:26:54,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2019-09-20 13:26:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:54,222 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,223 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, 1, 1, 1, 1] [2019-09-20 13:26:54,223 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2019-09-20 13:26:54,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,242 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-20 13:26:54,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,244 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2019-09-20 13:26:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,304 INFO L93 Difference]: Finished difference Result 17674 states and 23303 transitions. [2019-09-20 13:26:54,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,336 INFO L225 Difference]: With dead ends: 17674 [2019-09-20 13:26:54,337 INFO L226 Difference]: Without dead ends: 17674 [2019-09-20 13:26:54,337 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-20 13:26:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2019-09-20 13:26:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2019-09-20 13:26:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2019-09-20 13:26:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2019-09-20 13:26:55,117 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2019-09-20 13:26:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,118 INFO L475 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2019-09-20 13:26:55,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2019-09-20 13:26:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:55,138 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,138 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, 1, 1, 1, 1] [2019-09-20 13:26:55,138 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2019-09-20 13:26:55,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,160 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-20 13:26:55,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,162 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2019-09-20 13:26:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,249 INFO L93 Difference]: Finished difference Result 29706 states and 39175 transitions. [2019-09-20 13:26:55,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:55,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,303 INFO L225 Difference]: With dead ends: 29706 [2019-09-20 13:26:55,303 INFO L226 Difference]: Without dead ends: 29706 [2019-09-20 13:26:55,303 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-20 13:26:55,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2019-09-20 13:26:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2019-09-20 13:26:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2019-09-20 13:26:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2019-09-20 13:26:55,688 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2019-09-20 13:26:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,688 INFO L475 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2019-09-20 13:26:55,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2019-09-20 13:26:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:55,730 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,730 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, 1, 1, 1, 1] [2019-09-20 13:26:55,730 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,731 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2019-09-20 13:26:55,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,754 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-20 13:26:55,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,756 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2019-09-20 13:26:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,998 INFO L93 Difference]: Finished difference Result 34314 states and 43015 transitions. [2019-09-20 13:26:55,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,061 INFO L225 Difference]: With dead ends: 34314 [2019-09-20 13:26:56,061 INFO L226 Difference]: Without dead ends: 34314 [2019-09-20 13:26:56,061 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-20 13:26:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2019-09-20 13:26:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2019-09-20 13:26:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2019-09-20 13:26:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2019-09-20 13:26:56,448 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2019-09-20 13:26:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:56,449 INFO L475 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2019-09-20 13:26:56,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2019-09-20 13:26:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:26:56,476 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:56,476 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, 1, 1, 1, 1, 1] [2019-09-20 13:26:56,477 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:56,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:56,477 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2019-09-20 13:26:56,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:56,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:56,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,498 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-20 13:26:56,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:56,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:56,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:56,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,499 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2019-09-20 13:26:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:56,705 INFO L93 Difference]: Finished difference Result 34826 states and 43015 transitions. [2019-09-20 13:26:56,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:56,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:26:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,767 INFO L225 Difference]: With dead ends: 34826 [2019-09-20 13:26:56,767 INFO L226 Difference]: Without dead ends: 34826 [2019-09-20 13:26:56,768 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-20 13:26:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2019-09-20 13:26:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2019-09-20 13:26:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2019-09-20 13:26:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2019-09-20 13:26:57,133 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2019-09-20 13:26:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:57,134 INFO L475 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2019-09-20 13:26:57,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2019-09-20 13:26:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:26:57,158 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:57,158 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, 1, 1, 1, 1, 1] [2019-09-20 13:26:57,158 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:57,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2019-09-20 13:26:57,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:57,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:57,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:57,177 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-20 13:26:57,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:57,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:57,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:57,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:57,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:57,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:57,178 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2019-09-20 13:26:57,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:57,299 INFO L93 Difference]: Finished difference Result 57354 states and 70151 transitions. [2019-09-20 13:26:57,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:57,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:26:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:57,387 INFO L225 Difference]: With dead ends: 57354 [2019-09-20 13:26:57,388 INFO L226 Difference]: Without dead ends: 57354 [2019-09-20 13:26:57,388 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-20 13:26:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2019-09-20 13:26:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2019-09-20 13:26:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2019-09-20 13:26:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2019-09-20 13:26:58,115 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2019-09-20 13:26:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,115 INFO L475 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2019-09-20 13:26:58,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2019-09-20 13:26:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:26:58,156 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,156 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, 1, 1, 1, 1, 1] [2019-09-20 13:26:58,156 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2019-09-20 13:26:58,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,178 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-20 13:26:58,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,179 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2019-09-20 13:26:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,553 INFO L93 Difference]: Finished difference Result 67594 states and 78855 transitions. [2019-09-20 13:26:58,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:26:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,635 INFO L225 Difference]: With dead ends: 67594 [2019-09-20 13:26:58,635 INFO L226 Difference]: Without dead ends: 67594 [2019-09-20 13:26:58,636 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-20 13:26:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2019-09-20 13:26:59,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2019-09-20 13:26:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2019-09-20 13:26:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2019-09-20 13:26:59,200 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2019-09-20 13:26:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,200 INFO L475 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2019-09-20 13:26:59,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2019-09-20 13:26:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:26:59,231 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,231 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, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:59,231 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,231 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2019-09-20 13:26:59,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,248 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-20 13:26:59,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:59,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:59,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:59,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:59,250 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2019-09-20 13:26:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,648 INFO L93 Difference]: Finished difference Result 68618 states and 78855 transitions. [2019-09-20 13:26:59,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:59,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:26:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,708 INFO L225 Difference]: With dead ends: 68618 [2019-09-20 13:26:59,708 INFO L226 Difference]: Without dead ends: 68618 [2019-09-20 13:26:59,708 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-20 13:26:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2019-09-20 13:27:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2019-09-20 13:27:00,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2019-09-20 13:27:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2019-09-20 13:27:00,189 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2019-09-20 13:27:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,189 INFO L475 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2019-09-20 13:27:00,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2019-09-20 13:27:00,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:27:00,219 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,219 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, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,219 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2019-09-20 13:27:00,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,236 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-20 13:27:00,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,238 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2019-09-20 13:27:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,680 INFO L93 Difference]: Finished difference Result 110600 states and 123910 transitions. [2019-09-20 13:27:00,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:27:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,787 INFO L225 Difference]: With dead ends: 110600 [2019-09-20 13:27:00,787 INFO L226 Difference]: Without dead ends: 110600 [2019-09-20 13:27:00,788 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-20 13:27:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2019-09-20 13:27:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2019-09-20 13:27:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2019-09-20 13:27:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2019-09-20 13:27:01,564 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2019-09-20 13:27:01,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:01,564 INFO L475 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2019-09-20 13:27:01,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2019-09-20 13:27:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:27:03,239 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:03,239 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, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:03,240 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:03,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:03,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2019-09-20 13:27:03,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:03,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:03,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:03,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:03,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:03,257 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-20 13:27:03,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:03,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:03,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:03,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:03,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:03,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:03,258 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2019-09-20 13:27:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:03,559 INFO L93 Difference]: Finished difference Result 133126 states and 143365 transitions. [2019-09-20 13:27:03,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:03,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:27:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:03,560 INFO L225 Difference]: With dead ends: 133126 [2019-09-20 13:27:03,560 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:27:03,560 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-20 13:27:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:27:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:27:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:27:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:27:03,561 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-09-20 13:27:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:03,561 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:27:03,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:27:03,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:27:03,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:03 BoogieIcfgContainer [2019-09-20 13:27:03,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:03,580 INFO L168 Benchmark]: Toolchain (without parser) took 14933.22 ms. Allocated memory was 137.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 84.4 MB in the beginning and 904.5 MB in the end (delta: -820.1 MB). Peak memory consumption was 402.0 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:03,582 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 102.0 MB in the beginning and 101.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:27:03,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.74 ms. Allocated memory is still 137.4 MB. Free memory was 84.2 MB in the beginning and 72.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:03,584 INFO L168 Benchmark]: Boogie Preprocessor took 213.06 ms. Allocated memory was 137.4 MB in the beginning and 199.2 MB in the end (delta: 61.9 MB). Free memory was 72.8 MB in the beginning and 176.0 MB in the end (delta: -103.2 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:03,584 INFO L168 Benchmark]: RCFGBuilder took 481.38 ms. Allocated memory is still 199.2 MB. Free memory was 176.0 MB in the beginning and 154.7 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:03,585 INFO L168 Benchmark]: TraceAbstraction took 13887.02 ms. Allocated memory was 199.2 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 154.1 MB in the beginning and 904.5 MB in the end (delta: -750.4 MB). Peak memory consumption was 409.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:03,593 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.23 ms. Allocated memory is still 137.4 MB. Free memory was 102.0 MB in the beginning and 101.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 346.74 ms. Allocated memory is still 137.4 MB. Free memory was 84.2 MB in the beginning and 72.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 213.06 ms. Allocated memory was 137.4 MB in the beginning and 199.2 MB in the end (delta: 61.9 MB). Free memory was 72.8 MB in the beginning and 176.0 MB in the end (delta: -103.2 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 481.38 ms. Allocated memory is still 199.2 MB. Free memory was 176.0 MB in the beginning and 154.7 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13887.02 ms. Allocated memory was 199.2 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 154.1 MB in the beginning and 904.5 MB in the end (delta: -750.4 MB). Peak memory consumption was 409.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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, 50 locations, 1 error locations. SAFE Result, 13.7s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, 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: 6.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...