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-efa34d5 [2019-09-16 17:04:34,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:34,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:34,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:34,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:34,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:34,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:34,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:34,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:34,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:34,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:34,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:34,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:34,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:34,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:34,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:34,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:34,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:34,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:34,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:34,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:34,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:34,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:34,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:34,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:34,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:34,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:34,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:34,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:34,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:34,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:34,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:34,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:34,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:34,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:34,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:34,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:34,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:34,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:34,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:34,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:34,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:04:34,698 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:34,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:34,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:34,700 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:34,701 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:34,701 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:34,701 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:34,701 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:34,702 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:34,702 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:34,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:34,705 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:34,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:34,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:34,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:34,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:34,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:34,706 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:34,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:34,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:34,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:34,707 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:34,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:34,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:34,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:34,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:34,709 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:34,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:34,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:34,709 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:34,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:34,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:34,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:34,768 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:34,769 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:34,769 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-16 17:04:34,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf74702a5/7ee13a344fd8426ea15f134b4aaeefc3/FLAG24436a6e5 [2019-09-16 17:04:35,321 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:35,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2019-09-16 17:04:35,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf74702a5/7ee13a344fd8426ea15f134b4aaeefc3/FLAG24436a6e5 [2019-09-16 17:04:35,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf74702a5/7ee13a344fd8426ea15f134b4aaeefc3 [2019-09-16 17:04:35,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:35,718 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:35,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:35,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:35,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:35,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:35" (1/1) ... [2019-09-16 17:04:35,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6204aa8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:35, skipping insertion in model container [2019-09-16 17:04:35,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:35" (1/1) ... [2019-09-16 17:04:35,734 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:35,763 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:36,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:36,070 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:36,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:36,259 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:36,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36 WrapperNode [2019-09-16 17:04:36,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:36,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:36,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:36,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:36,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... [2019-09-16 17:04:36,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:36,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:36,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:36,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:36,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:36,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:36,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:36,387 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:36,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:36,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:36,387 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:36,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:36,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:36,751 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:36,751 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:36,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:36 BoogieIcfgContainer [2019-09-16 17:04:36,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:36,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:36,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:36,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:36,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:35" (1/3) ... [2019-09-16 17:04:36,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c78a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:36, skipping insertion in model container [2019-09-16 17:04:36,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:36" (2/3) ... [2019-09-16 17:04:36,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c78a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:36, skipping insertion in model container [2019-09-16 17:04:36,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:36" (3/3) ... [2019-09-16 17:04:36,762 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-09-16 17:04:36,773 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:36,782 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:36,800 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:36,841 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:36,842 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:36,842 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:36,842 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:36,842 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:36,843 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:36,843 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:36,843 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-09-16 17:04:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:36,878 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,879 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,881 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2019-09-16 17:04:36,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,111 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-09-16 17:04:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,175 INFO L93 Difference]: Finished difference Result 92 states and 161 transitions. [2019-09-16 17:04:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,190 INFO L225 Difference]: With dead ends: 92 [2019-09-16 17:04:37,190 INFO L226 Difference]: Without dead ends: 84 [2019-09-16 17:04:37,192 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-16 17:04:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-09-16 17:04:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-16 17:04:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2019-09-16 17:04:37,245 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2019-09-16 17:04:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,246 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2019-09-16 17:04:37,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2019-09-16 17:04:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:37,247 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,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-16 17:04:37,248 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2019-09-16 17:04:37,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,332 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2019-09-16 17:04:37,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,366 INFO L93 Difference]: Finished difference Result 84 states and 150 transitions. [2019-09-16 17:04:37,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:37,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,369 INFO L225 Difference]: With dead ends: 84 [2019-09-16 17:04:37,370 INFO L226 Difference]: Without dead ends: 84 [2019-09-16 17:04:37,371 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-16 17:04:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-09-16 17:04:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-16 17:04:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2019-09-16 17:04:37,387 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2019-09-16 17:04:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,388 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2019-09-16 17:04:37,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2019-09-16 17:04:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:37,389 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,390 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,390 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2019-09-16 17:04:37,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,488 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2019-09-16 17:04:37,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,532 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2019-09-16 17:04:37,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:37,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,537 INFO L225 Difference]: With dead ends: 87 [2019-09-16 17:04:37,537 INFO L226 Difference]: Without dead ends: 87 [2019-09-16 17:04:37,538 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-16 17:04:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-09-16 17:04:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-16 17:04:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2019-09-16 17:04:37,556 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2019-09-16 17:04:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,557 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2019-09-16 17:04:37,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2019-09-16 17:04:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:37,558 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,558 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,559 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,559 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2019-09-16 17:04:37,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,601 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2019-09-16 17:04:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,629 INFO L93 Difference]: Finished difference Result 158 states and 285 transitions. [2019-09-16 17:04:37,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,632 INFO L225 Difference]: With dead ends: 158 [2019-09-16 17:04:37,632 INFO L226 Difference]: Without dead ends: 158 [2019-09-16 17:04:37,632 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-16 17:04:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2019-09-16 17:04:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-16 17:04:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2019-09-16 17:04:37,646 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2019-09-16 17:04:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,646 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2019-09-16 17:04:37,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2019-09-16 17:04:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:37,648 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,648 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,650 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2019-09-16 17:04:37,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,698 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2019-09-16 17:04:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,725 INFO L93 Difference]: Finished difference Result 160 states and 283 transitions. [2019-09-16 17:04:37,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,727 INFO L225 Difference]: With dead ends: 160 [2019-09-16 17:04:37,728 INFO L226 Difference]: Without dead ends: 160 [2019-09-16 17:04:37,728 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-16 17:04:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-09-16 17:04:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-16 17:04:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2019-09-16 17:04:37,740 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2019-09-16 17:04:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,741 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2019-09-16 17:04:37,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2019-09-16 17:04:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:37,743 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,743 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,743 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2019-09-16 17:04:37,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,790 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2019-09-16 17:04:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,817 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2019-09-16 17:04:37,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,819 INFO L225 Difference]: With dead ends: 162 [2019-09-16 17:04:37,819 INFO L226 Difference]: Without dead ends: 162 [2019-09-16 17:04:37,820 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-16 17:04:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-09-16 17:04:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-16 17:04:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2019-09-16 17:04:37,844 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2019-09-16 17:04:37,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,845 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2019-09-16 17:04:37,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2019-09-16 17:04:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:37,849 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,849 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,849 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,850 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2019-09-16 17:04:37,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,928 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2019-09-16 17:04:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,953 INFO L93 Difference]: Finished difference Result 298 states and 531 transitions. [2019-09-16 17:04:37,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,956 INFO L225 Difference]: With dead ends: 298 [2019-09-16 17:04:37,956 INFO L226 Difference]: Without dead ends: 298 [2019-09-16 17:04:37,957 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-16 17:04:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2019-09-16 17:04:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-16 17:04:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-09-16 17:04:37,984 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2019-09-16 17:04:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,985 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-09-16 17:04:37,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-09-16 17:04:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:37,990 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,993 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,993 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2019-09-16 17:04:37,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,046 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,048 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2019-09-16 17:04:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,069 INFO L93 Difference]: Finished difference Result 306 states and 531 transitions. [2019-09-16 17:04:38,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:38,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,072 INFO L225 Difference]: With dead ends: 306 [2019-09-16 17:04:38,073 INFO L226 Difference]: Without dead ends: 306 [2019-09-16 17:04:38,073 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-16 17:04:38,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-16 17:04:38,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-16 17:04:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2019-09-16 17:04:38,082 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2019-09-16 17:04:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,083 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2019-09-16 17:04:38,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2019-09-16 17:04:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:38,085 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,085 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,085 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,086 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2019-09-16 17:04:38,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,128 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2019-09-16 17:04:38,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,144 INFO L93 Difference]: Finished difference Result 310 states and 531 transitions. [2019-09-16 17:04:38,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,147 INFO L225 Difference]: With dead ends: 310 [2019-09-16 17:04:38,147 INFO L226 Difference]: Without dead ends: 310 [2019-09-16 17:04:38,147 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-16 17:04:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-09-16 17:04:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-16 17:04:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2019-09-16 17:04:38,157 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2019-09-16 17:04:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,159 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2019-09-16 17:04:38,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2019-09-16 17:04:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:38,160 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,161 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,161 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,161 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2019-09-16 17:04:38,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,200 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2019-09-16 17:04:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,221 INFO L93 Difference]: Finished difference Result 570 states and 991 transitions. [2019-09-16 17:04:38,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,225 INFO L225 Difference]: With dead ends: 570 [2019-09-16 17:04:38,226 INFO L226 Difference]: Without dead ends: 570 [2019-09-16 17:04:38,226 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-16 17:04:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2019-09-16 17:04:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-16 17:04:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2019-09-16 17:04:38,242 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2019-09-16 17:04:38,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,245 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2019-09-16 17:04:38,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2019-09-16 17:04:38,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:38,249 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,250 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,251 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2019-09-16 17:04:38,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,300 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2019-09-16 17:04:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,334 INFO L93 Difference]: Finished difference Result 594 states and 999 transitions. [2019-09-16 17:04:38,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,338 INFO L225 Difference]: With dead ends: 594 [2019-09-16 17:04:38,338 INFO L226 Difference]: Without dead ends: 594 [2019-09-16 17:04:38,340 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-16 17:04:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2019-09-16 17:04:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-16 17:04:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2019-09-16 17:04:38,356 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2019-09-16 17:04:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,356 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2019-09-16 17:04:38,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2019-09-16 17:04:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 17:04:38,357 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,358 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,358 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,358 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2019-09-16 17:04:38,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,405 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2019-09-16 17:04:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,422 INFO L93 Difference]: Finished difference Result 602 states and 999 transitions. [2019-09-16 17:04:38,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 17:04:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,427 INFO L225 Difference]: With dead ends: 602 [2019-09-16 17:04:38,427 INFO L226 Difference]: Without dead ends: 602 [2019-09-16 17:04:38,428 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-16 17:04:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-09-16 17:04:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-16 17:04:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2019-09-16 17:04:38,442 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2019-09-16 17:04:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,442 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2019-09-16 17:04:38,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2019-09-16 17:04:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 17:04:38,444 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,444 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,444 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2019-09-16 17:04:38,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,476 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2019-09-16 17:04:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,506 INFO L93 Difference]: Finished difference Result 1098 states and 1847 transitions. [2019-09-16 17:04:38,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 17:04:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,515 INFO L225 Difference]: With dead ends: 1098 [2019-09-16 17:04:38,515 INFO L226 Difference]: Without dead ends: 1098 [2019-09-16 17:04:38,515 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-09-16 17:04:38,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2019-09-16 17:04:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-09-16 17:04:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2019-09-16 17:04:38,547 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2019-09-16 17:04:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,547 INFO L475 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2019-09-16 17:04:38,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2019-09-16 17:04:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 17:04:38,550 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,551 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,551 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2019-09-16 17:04:38,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,591 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2019-09-16 17:04:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,616 INFO L93 Difference]: Finished difference Result 1162 states and 1879 transitions. [2019-09-16 17:04:38,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 17:04:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,623 INFO L225 Difference]: With dead ends: 1162 [2019-09-16 17:04:38,623 INFO L226 Difference]: Without dead ends: 1162 [2019-09-16 17:04:38,624 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-09-16 17:04:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2019-09-16 17:04:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-09-16 17:04:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2019-09-16 17:04:38,652 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2019-09-16 17:04:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,653 INFO L475 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2019-09-16 17:04:38,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2019-09-16 17:04:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:04:38,655 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,655 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,656 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,656 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2019-09-16 17:04:38,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,691 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2019-09-16 17:04:38,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,710 INFO L93 Difference]: Finished difference Result 1178 states and 1879 transitions. [2019-09-16 17:04:38,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 17:04:38,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,716 INFO L225 Difference]: With dead ends: 1178 [2019-09-16 17:04:38,716 INFO L226 Difference]: Without dead ends: 1178 [2019-09-16 17:04:38,718 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-09-16 17:04:38,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2019-09-16 17:04:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2019-09-16 17:04:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2019-09-16 17:04:38,747 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2019-09-16 17:04:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,747 INFO L475 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2019-09-16 17:04:38,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2019-09-16 17:04:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:04:38,749 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,750 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,750 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,750 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2019-09-16 17:04:38,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,780 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2019-09-16 17:04:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,805 INFO L93 Difference]: Finished difference Result 2122 states and 3431 transitions. [2019-09-16 17:04:38,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 17:04:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,816 INFO L225 Difference]: With dead ends: 2122 [2019-09-16 17:04:38,816 INFO L226 Difference]: Without dead ends: 2122 [2019-09-16 17:04:38,817 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-09-16 17:04:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2019-09-16 17:04:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-09-16 17:04:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2019-09-16 17:04:38,870 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2019-09-16 17:04:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,870 INFO L475 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2019-09-16 17:04:38,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2019-09-16 17:04:38,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:04:38,873 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,874 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,874 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2019-09-16 17:04:38,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:38,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:38,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:38,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,893 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2019-09-16 17:04:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,918 INFO L93 Difference]: Finished difference Result 2282 states and 3527 transitions. [2019-09-16 17:04:38,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:38,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 17:04:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,929 INFO L225 Difference]: With dead ends: 2282 [2019-09-16 17:04:38,929 INFO L226 Difference]: Without dead ends: 2282 [2019-09-16 17:04:38,930 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-09-16 17:04:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2019-09-16 17:04:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-09-16 17:04:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2019-09-16 17:04:38,981 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2019-09-16 17:04:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,981 INFO L475 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2019-09-16 17:04:38,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2019-09-16 17:04:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 17:04:38,985 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,985 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-16 17:04:38,985 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2019-09-16 17:04:38,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:39,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:39,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:39,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:39,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:39,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:39,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,007 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2019-09-16 17:04:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,033 INFO L93 Difference]: Finished difference Result 2314 states and 3527 transitions. [2019-09-16 17:04:39,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:39,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 17:04:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,044 INFO L225 Difference]: With dead ends: 2314 [2019-09-16 17:04:39,044 INFO L226 Difference]: Without dead ends: 2314 [2019-09-16 17:04:39,045 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-09-16 17:04:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2019-09-16 17:04:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-09-16 17:04:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2019-09-16 17:04:39,097 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2019-09-16 17:04:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:39,097 INFO L475 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2019-09-16 17:04:39,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2019-09-16 17:04:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 17:04:39,101 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:39,101 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-16 17:04:39,101 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:39,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2019-09-16 17:04:39,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:39,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-16 17:04:39,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:39,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:39,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:39,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:39,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:39,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,125 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2019-09-16 17:04:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,164 INFO L93 Difference]: Finished difference Result 4106 states and 6343 transitions. [2019-09-16 17:04:39,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:39,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 17:04:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,184 INFO L225 Difference]: With dead ends: 4106 [2019-09-16 17:04:39,185 INFO L226 Difference]: Without dead ends: 4106 [2019-09-16 17:04:39,185 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-09-16 17:04:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2019-09-16 17:04:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-09-16 17:04:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2019-09-16 17:04:39,286 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2019-09-16 17:04:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:39,287 INFO L475 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2019-09-16 17:04:39,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2019-09-16 17:04:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 17:04:39,292 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:39,292 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-16 17:04:39,293 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:39,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:39,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2019-09-16 17:04:39,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:39,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:39,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:39,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:39,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:39,320 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:39,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:39,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,321 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2019-09-16 17:04:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,366 INFO L93 Difference]: Finished difference Result 4490 states and 6599 transitions. [2019-09-16 17:04:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:39,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 17:04:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,396 INFO L225 Difference]: With dead ends: 4490 [2019-09-16 17:04:39,396 INFO L226 Difference]: Without dead ends: 4490 [2019-09-16 17:04:39,397 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-09-16 17:04:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2019-09-16 17:04:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2019-09-16 17:04:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2019-09-16 17:04:39,541 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2019-09-16 17:04:39,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:39,542 INFO L475 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2019-09-16 17:04:39,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2019-09-16 17:04:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 17:04:39,626 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:39,626 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:39,626 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:39,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2019-09-16 17:04:39,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:39,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:39,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:39,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:39,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:39,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:39,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:39,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:39,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,647 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2019-09-16 17:04:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,695 INFO L93 Difference]: Finished difference Result 4554 states and 6599 transitions. [2019-09-16 17:04:39,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:39,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 17:04:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,729 INFO L225 Difference]: With dead ends: 4554 [2019-09-16 17:04:39,729 INFO L226 Difference]: Without dead ends: 4554 [2019-09-16 17:04:39,730 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2019-09-16 17:04:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2019-09-16 17:04:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2019-09-16 17:04:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2019-09-16 17:04:39,854 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2019-09-16 17:04:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:39,854 INFO L475 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2019-09-16 17:04:39,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2019-09-16 17:04:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 17:04:39,861 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:39,861 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-16 17:04:39,862 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:39,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:39,862 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2019-09-16 17:04:39,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:39,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:39,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:39,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:39,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:39,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:39,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:39,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:39,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,892 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2019-09-16 17:04:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,943 INFO L93 Difference]: Finished difference Result 8842 states and 12423 transitions. [2019-09-16 17:04:39,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:39,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 17:04:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,964 INFO L225 Difference]: With dead ends: 8842 [2019-09-16 17:04:39,964 INFO L226 Difference]: Without dead ends: 8842 [2019-09-16 17:04:39,965 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:39,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2019-09-16 17:04:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2019-09-16 17:04:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-09-16 17:04:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2019-09-16 17:04:40,138 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2019-09-16 17:04:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:40,138 INFO L475 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2019-09-16 17:04:40,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2019-09-16 17:04:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 17:04:40,153 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:40,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, 1, 1, 1, 1] [2019-09-16 17:04:40,154 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:40,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:40,154 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2019-09-16 17:04:40,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:40,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:40,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:40,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:40,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:40,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:40,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,183 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2019-09-16 17:04:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:40,267 INFO L93 Difference]: Finished difference Result 10122 states and 14599 transitions. [2019-09-16 17:04:40,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:40,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 17:04:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:40,289 INFO L225 Difference]: With dead ends: 10122 [2019-09-16 17:04:40,290 INFO L226 Difference]: Without dead ends: 10122 [2019-09-16 17:04:40,290 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2019-09-16 17:04:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2019-09-16 17:04:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-09-16 17:04:40,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2019-09-16 17:04:40,490 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2019-09-16 17:04:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:40,490 INFO L475 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2019-09-16 17:04:40,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2019-09-16 17:04:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:04:40,502 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:40,502 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-16 17:04:40,502 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:40,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2019-09-16 17:04:40,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:40,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:40,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:40,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:40,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:40,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:40,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:40,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:40,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,533 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2019-09-16 17:04:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:40,590 INFO L93 Difference]: Finished difference Result 15242 states and 21383 transitions. [2019-09-16 17:04:40,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:40,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:04:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:40,623 INFO L225 Difference]: With dead ends: 15242 [2019-09-16 17:04:40,623 INFO L226 Difference]: Without dead ends: 15242 [2019-09-16 17:04:40,628 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2019-09-16 17:04:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2019-09-16 17:04:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-09-16 17:04:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2019-09-16 17:04:40,891 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2019-09-16 17:04:40,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:40,891 INFO L475 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2019-09-16 17:04:40,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2019-09-16 17:04:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:04:40,915 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:40,916 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-16 17:04:40,916 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:40,916 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2019-09-16 17:04:40,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:40,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:40,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:40,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:40,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:40,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:40,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:40,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:40,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:40,944 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2019-09-16 17:04:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:41,013 INFO L93 Difference]: Finished difference Result 17290 states and 23047 transitions. [2019-09-16 17:04:41,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:41,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:04:41,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:41,053 INFO L225 Difference]: With dead ends: 17290 [2019-09-16 17:04:41,053 INFO L226 Difference]: Without dead ends: 17290 [2019-09-16 17:04:41,053 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2019-09-16 17:04:41,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2019-09-16 17:04:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2019-09-16 17:04:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2019-09-16 17:04:41,370 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2019-09-16 17:04:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:41,370 INFO L475 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2019-09-16 17:04:41,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2019-09-16 17:04:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 17:04:41,391 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:41,392 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-16 17:04:41,392 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:41,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:41,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2019-09-16 17:04:41,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:41,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:41,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:41,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:41,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:41,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:41,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:41,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:41,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:41,412 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2019-09-16 17:04:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:41,465 INFO L93 Difference]: Finished difference Result 17674 states and 23303 transitions. [2019-09-16 17:04:41,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:41,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 17:04:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:41,495 INFO L225 Difference]: With dead ends: 17674 [2019-09-16 17:04:41,495 INFO L226 Difference]: Without dead ends: 17674 [2019-09-16 17:04:41,496 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2019-09-16 17:04:41,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2019-09-16 17:04:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2019-09-16 17:04:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2019-09-16 17:04:41,821 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2019-09-16 17:04:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:41,822 INFO L475 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2019-09-16 17:04:41,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2019-09-16 17:04:41,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 17:04:41,843 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:41,843 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-16 17:04:41,843 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:41,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:41,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2019-09-16 17:04:41,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:41,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:41,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:41,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:41,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:41,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:41,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:41,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:41,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:41,862 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2019-09-16 17:04:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:41,938 INFO L93 Difference]: Finished difference Result 29706 states and 39175 transitions. [2019-09-16 17:04:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:41,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 17:04:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:41,993 INFO L225 Difference]: With dead ends: 29706 [2019-09-16 17:04:41,994 INFO L226 Difference]: Without dead ends: 29706 [2019-09-16 17:04:41,994 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2019-09-16 17:04:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2019-09-16 17:04:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2019-09-16 17:04:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2019-09-16 17:04:42,447 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2019-09-16 17:04:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:42,448 INFO L475 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2019-09-16 17:04:42,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2019-09-16 17:04:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 17:04:43,103 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:43,103 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-16 17:04:43,103 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:43,104 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2019-09-16 17:04:43,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:43,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:43,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:43,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:43,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:43,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:43,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:43,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:43,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:43,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:43,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:43,127 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2019-09-16 17:04:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:43,222 INFO L93 Difference]: Finished difference Result 34314 states and 43015 transitions. [2019-09-16 17:04:43,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:43,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 17:04:43,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:43,292 INFO L225 Difference]: With dead ends: 34314 [2019-09-16 17:04:43,292 INFO L226 Difference]: Without dead ends: 34314 [2019-09-16 17:04:43,293 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:43,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2019-09-16 17:04:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2019-09-16 17:04:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2019-09-16 17:04:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2019-09-16 17:04:43,972 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2019-09-16 17:04:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:43,973 INFO L475 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2019-09-16 17:04:43,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2019-09-16 17:04:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 17:04:44,005 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:44,005 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-16 17:04:44,005 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:44,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:44,006 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2019-09-16 17:04:44,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:44,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:44,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:44,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:44,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:44,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:44,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:44,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:44,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:44,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:44,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:44,034 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2019-09-16 17:04:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:44,126 INFO L93 Difference]: Finished difference Result 34826 states and 43015 transitions. [2019-09-16 17:04:44,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:44,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-16 17:04:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:44,172 INFO L225 Difference]: With dead ends: 34826 [2019-09-16 17:04:44,172 INFO L226 Difference]: Without dead ends: 34826 [2019-09-16 17:04:44,173 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2019-09-16 17:04:44,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2019-09-16 17:04:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2019-09-16 17:04:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2019-09-16 17:04:44,566 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2019-09-16 17:04:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:44,567 INFO L475 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2019-09-16 17:04:44,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2019-09-16 17:04:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 17:04:44,599 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:44,600 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-16 17:04:44,600 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2019-09-16 17:04:44,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:44,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:44,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:44,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:44,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:44,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:44,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:44,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:44,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:44,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:44,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:44,618 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2019-09-16 17:04:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:44,736 INFO L93 Difference]: Finished difference Result 57354 states and 70151 transitions. [2019-09-16 17:04:44,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:44,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-16 17:04:44,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:44,808 INFO L225 Difference]: With dead ends: 57354 [2019-09-16 17:04:44,808 INFO L226 Difference]: Without dead ends: 57354 [2019-09-16 17:04:44,808 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2019-09-16 17:04:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2019-09-16 17:04:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2019-09-16 17:04:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2019-09-16 17:04:45,589 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2019-09-16 17:04:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:45,589 INFO L475 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2019-09-16 17:04:45,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2019-09-16 17:04:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 17:04:45,631 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:45,631 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:45,631 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:45,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:45,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2019-09-16 17:04:45,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:45,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:45,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:45,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:45,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:45,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:45,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:45,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:45,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:45,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:45,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:45,650 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2019-09-16 17:04:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:45,828 INFO L93 Difference]: Finished difference Result 67594 states and 78855 transitions. [2019-09-16 17:04:45,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:45,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-16 17:04:45,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:45,907 INFO L225 Difference]: With dead ends: 67594 [2019-09-16 17:04:45,907 INFO L226 Difference]: Without dead ends: 67594 [2019-09-16 17:04:45,907 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2019-09-16 17:04:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2019-09-16 17:04:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2019-09-16 17:04:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2019-09-16 17:04:46,715 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2019-09-16 17:04:46,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,715 INFO L475 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2019-09-16 17:04:46,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:46,716 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2019-09-16 17:04:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 17:04:46,755 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,755 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-16 17:04:46,755 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2019-09-16 17:04:46,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:46,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:46,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:46,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:46,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:46,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:46,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:46,782 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2019-09-16 17:04:46,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,967 INFO L93 Difference]: Finished difference Result 68618 states and 78855 transitions. [2019-09-16 17:04:46,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:46,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-16 17:04:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,048 INFO L225 Difference]: With dead ends: 68618 [2019-09-16 17:04:47,049 INFO L226 Difference]: Without dead ends: 68618 [2019-09-16 17:04:47,049 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2019-09-16 17:04:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2019-09-16 17:04:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2019-09-16 17:04:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2019-09-16 17:04:47,933 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2019-09-16 17:04:47,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,933 INFO L475 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2019-09-16 17:04:47,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2019-09-16 17:04:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 17:04:47,961 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,961 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-16 17:04:47,961 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2019-09-16 17:04:47,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:47,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,981 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2019-09-16 17:04:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:48,217 INFO L93 Difference]: Finished difference Result 110600 states and 123910 transitions. [2019-09-16 17:04:48,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:48,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-16 17:04:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:48,787 INFO L225 Difference]: With dead ends: 110600 [2019-09-16 17:04:48,788 INFO L226 Difference]: Without dead ends: 110600 [2019-09-16 17:04:48,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-16 17:04:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2019-09-16 17:04:49,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2019-09-16 17:04:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2019-09-16 17:04:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2019-09-16 17:04:49,645 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2019-09-16 17:04:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,645 INFO L475 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2019-09-16 17:04:49,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2019-09-16 17:04:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 17:04:49,704 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,704 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-16 17:04:49,704 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2019-09-16 17:04:49,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:49,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,730 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2019-09-16 17:04:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:50,420 INFO L93 Difference]: Finished difference Result 133126 states and 143365 transitions. [2019-09-16 17:04:50,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:50,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-16 17:04:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:50,421 INFO L225 Difference]: With dead ends: 133126 [2019-09-16 17:04:50,421 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:04:50,421 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:50,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:04:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:04:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:04:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:04:50,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-09-16 17:04:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:50,422 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:04:50,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:04:50,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:04:50,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:04:50 BoogieIcfgContainer [2019-09-16 17:04:50,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:04:50,436 INFO L168 Benchmark]: Toolchain (without parser) took 14711.42 ms. Allocated memory was 132.6 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 87.4 MB in the beginning and 865.4 MB in the end (delta: -778.0 MB). Peak memory consumption was 367.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:50,440 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 132.6 MB. Free memory was 105.6 MB in the beginning and 105.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:04:50,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 541.59 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 87.2 MB in the beginning and 176.6 MB in the end (delta: -89.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:50,442 INFO L168 Benchmark]: Boogie Preprocessor took 56.55 ms. Allocated memory is still 199.2 MB. Free memory was 176.6 MB in the beginning and 174.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:50,444 INFO L168 Benchmark]: RCFGBuilder took 434.68 ms. Allocated memory is still 199.2 MB. Free memory was 173.7 MB in the beginning and 153.4 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:50,444 INFO L168 Benchmark]: TraceAbstraction took 13674.45 ms. Allocated memory was 199.2 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 153.4 MB in the beginning and 865.4 MB in the end (delta: -712.0 MB). Peak memory consumption was 366.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:50,454 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.24 ms. Allocated memory is still 132.6 MB. Free memory was 105.6 MB in the beginning and 105.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 541.59 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 87.2 MB in the beginning and 176.6 MB in the end (delta: -89.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.55 ms. Allocated memory is still 199.2 MB. Free memory was 176.6 MB in the beginning and 174.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 434.68 ms. Allocated memory is still 199.2 MB. Free memory was 173.7 MB in the beginning and 153.4 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13674.45 ms. Allocated memory was 199.2 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 153.4 MB in the beginning and 865.4 MB in the end (delta: -712.0 MB). Peak memory consumption was 366.5 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.6s 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.4s 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.9s 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...