java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:50:10,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:50:10,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:50:10,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:50:10,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:50:10,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:50:10,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:50:10,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:50:10,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:50:10,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:50:10,770 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:50:10,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:50:10,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:50:10,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:50:10,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:50:10,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:50:10,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:50:10,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:50:10,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:50:10,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:50:10,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:50:10,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:50:10,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:50:10,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:50:10,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:50:10,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:50:10,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:50:10,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:50:10,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:50:10,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:50:10,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:50:10,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:50:10,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:50:10,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:50:10,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:50:10,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:50:10,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:50:10,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:50:10,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:50:10,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:50:10,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:50:10,817 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-09 05:50:10,845 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:50:10,845 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:50:10,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:50:10,846 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:50:10,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:50:10,847 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:50:10,850 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:50:10,851 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:50:10,851 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:50:10,851 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:50:10,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:50:10,852 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:50:10,853 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:50:10,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:50:10,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:50:10,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:50:10,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:50:10,854 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:50:10,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:50:10,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:50:10,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:50:10,855 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:50:10,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:50:10,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:50:10,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:50:10,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:50:10,859 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:50:10,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:50:10,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:50:10,860 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:50:10,896 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:50:10,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:50:10,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:50:10,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:50:10,912 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:50:10,913 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-09-09 05:50:10,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea342b8c/1050864284ad423181f5c8c7e29b18d1/FLAGb9b50cfde [2019-09-09 05:50:11,446 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:50:11,447 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-09-09 05:50:11,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea342b8c/1050864284ad423181f5c8c7e29b18d1/FLAGb9b50cfde [2019-09-09 05:50:11,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea342b8c/1050864284ad423181f5c8c7e29b18d1 [2019-09-09 05:50:11,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:50:11,826 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:50:11,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:50:11,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:50:11,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:50:11,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:50:11" (1/1) ... [2019-09-09 05:50:11,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664351b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:11, skipping insertion in model container [2019-09-09 05:50:11,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:50:11" (1/1) ... [2019-09-09 05:50:11,843 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:50:11,869 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:50:12,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:50:12,059 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:50:12,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:50:12,203 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:50:12,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:12 WrapperNode [2019-09-09 05:50:12,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:50:12,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:50:12,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:50:12,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:50:12,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:12" (1/1) ... [2019-09-09 05:50:12,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:12" (1/1) ... [2019-09-09 05:50:12,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:12" (1/1) ... [2019-09-09 05:50:12,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:12" (1/1) ... [2019-09-09 05:50:12,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:12" (1/1) ... [2019-09-09 05:50:12,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:12" (1/1) ... [2019-09-09 05:50:12,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:12" (1/1) ... [2019-09-09 05:50:12,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:50:12,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:50:12,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:50:12,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:50:12,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:12" (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-09 05:50:12,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:50:12,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:50:12,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:50:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:50:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:50:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:50:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:50:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:50:12,633 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:50:12,633 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:50:12,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:50:12 BoogieIcfgContainer [2019-09-09 05:50:12,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:50:12,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:50:12,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:50:12,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:50:12,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:50:11" (1/3) ... [2019-09-09 05:50:12,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680b5ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:50:12, skipping insertion in model container [2019-09-09 05:50:12,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:12" (2/3) ... [2019-09-09 05:50:12,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680b5ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:50:12, skipping insertion in model container [2019-09-09 05:50:12,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:50:12" (3/3) ... [2019-09-09 05:50:12,649 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-09-09 05:50:12,657 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:50:12,666 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:50:12,678 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:50:12,707 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:50:12,707 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:50:12,707 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:50:12,708 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:50:12,708 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:50:12,708 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:50:12,708 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:50:12,708 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:50:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-09-09 05:50:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-09 05:50:12,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:12,742 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:12,744 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:12,749 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2019-09-09 05:50:12,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:12,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:12,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:12,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:12,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:12,922 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-09 05:50:12,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:12,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:12,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:12,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:12,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:12,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:12,947 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-09-09 05:50:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:13,014 INFO L93 Difference]: Finished difference Result 74 states and 125 transitions. [2019-09-09 05:50:13,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:13,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-09 05:50:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:13,035 INFO L225 Difference]: With dead ends: 74 [2019-09-09 05:50:13,035 INFO L226 Difference]: Without dead ends: 66 [2019-09-09 05:50:13,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-09 05:50:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-09-09 05:50:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-09 05:50:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2019-09-09 05:50:13,115 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2019-09-09 05:50:13,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:13,116 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2019-09-09 05:50:13,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2019-09-09 05:50:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-09 05:50:13,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:13,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:13,122 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2019-09-09 05:50:13,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:13,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:13,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:13,240 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-09 05:50:13,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:13,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:13,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:13,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:13,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:13,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,249 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2019-09-09 05:50:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:13,303 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2019-09-09 05:50:13,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:13,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-09 05:50:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:13,305 INFO L225 Difference]: With dead ends: 66 [2019-09-09 05:50:13,305 INFO L226 Difference]: Without dead ends: 66 [2019-09-09 05:50:13,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-09 05:50:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-09 05:50:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-09 05:50:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2019-09-09 05:50:13,322 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2019-09-09 05:50:13,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:13,323 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2019-09-09 05:50:13,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2019-09-09 05:50:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:50:13,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:13,326 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:13,328 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:13,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:13,329 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2019-09-09 05:50:13,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:13,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:13,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:13,407 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-09 05:50:13,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:13,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:13,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:13,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:13,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:13,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,411 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2019-09-09 05:50:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:13,446 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2019-09-09 05:50:13,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:13,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:50:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:13,448 INFO L225 Difference]: With dead ends: 69 [2019-09-09 05:50:13,449 INFO L226 Difference]: Without dead ends: 69 [2019-09-09 05:50:13,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-09 05:50:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-09 05:50:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-09 05:50:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2019-09-09 05:50:13,459 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2019-09-09 05:50:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:13,460 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2019-09-09 05:50:13,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2019-09-09 05:50:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:50:13,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:13,463 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:13,464 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2019-09-09 05:50:13,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:13,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:13,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:13,502 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-09 05:50:13,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:13,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:13,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:13,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:13,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:13,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,504 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2019-09-09 05:50:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:13,523 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2019-09-09 05:50:13,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:13,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:50:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:13,525 INFO L225 Difference]: With dead ends: 122 [2019-09-09 05:50:13,525 INFO L226 Difference]: Without dead ends: 122 [2019-09-09 05:50:13,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-09 05:50:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-09-09 05:50:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-09 05:50:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2019-09-09 05:50:13,535 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2019-09-09 05:50:13,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:13,536 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2019-09-09 05:50:13,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2019-09-09 05:50:13,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:50:13,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:13,538 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:13,538 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:13,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:13,538 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2019-09-09 05:50:13,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:13,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:13,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:13,605 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-09 05:50:13,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:13,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:13,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:13,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:13,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:13,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,608 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2019-09-09 05:50:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:13,637 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2019-09-09 05:50:13,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:13,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:50:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:13,639 INFO L225 Difference]: With dead ends: 124 [2019-09-09 05:50:13,639 INFO L226 Difference]: Without dead ends: 124 [2019-09-09 05:50:13,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-09 05:50:13,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-09-09 05:50:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-09 05:50:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2019-09-09 05:50:13,650 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2019-09-09 05:50:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:13,650 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2019-09-09 05:50:13,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2019-09-09 05:50:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:50:13,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:13,652 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:13,652 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:13,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2019-09-09 05:50:13,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:13,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:13,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:13,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-09 05:50:13,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:13,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:13,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:13,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:13,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:13,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,691 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2019-09-09 05:50:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:13,707 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2019-09-09 05:50:13,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:13,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:50:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:13,710 INFO L225 Difference]: With dead ends: 126 [2019-09-09 05:50:13,710 INFO L226 Difference]: Without dead ends: 126 [2019-09-09 05:50:13,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-09 05:50:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-09-09 05:50:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-09 05:50:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-09-09 05:50:13,719 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2019-09-09 05:50:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:13,719 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-09-09 05:50:13,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-09-09 05:50:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:50:13,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:13,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:13,721 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:13,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2019-09-09 05:50:13,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:13,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:13,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:13,761 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-09 05:50:13,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:13,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:13,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:13,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:13,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:13,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,764 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2019-09-09 05:50:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:13,794 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2019-09-09 05:50:13,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:13,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:50:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:13,797 INFO L225 Difference]: With dead ends: 226 [2019-09-09 05:50:13,797 INFO L226 Difference]: Without dead ends: 226 [2019-09-09 05:50:13,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-09 05:50:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2019-09-09 05:50:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-09 05:50:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2019-09-09 05:50:13,820 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2019-09-09 05:50:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:13,823 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2019-09-09 05:50:13,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2019-09-09 05:50:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:50:13,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:13,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:13,829 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:13,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2019-09-09 05:50:13,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:13,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:13,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:13,879 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-09 05:50:13,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:13,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:13,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:13,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:13,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:13,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,881 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2019-09-09 05:50:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:13,908 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2019-09-09 05:50:13,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:13,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:50:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:13,910 INFO L225 Difference]: With dead ends: 234 [2019-09-09 05:50:13,911 INFO L226 Difference]: Without dead ends: 234 [2019-09-09 05:50:13,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-09 05:50:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-09-09 05:50:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-09 05:50:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2019-09-09 05:50:13,931 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2019-09-09 05:50:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:13,931 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2019-09-09 05:50:13,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2019-09-09 05:50:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:50:13,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:13,936 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:13,936 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:13,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:13,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2019-09-09 05:50:13,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:13,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:13,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:13,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:13,994 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-09 05:50:13,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:13,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:13,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:13,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:13,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:13,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:13,997 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2019-09-09 05:50:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,016 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2019-09-09 05:50:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:50:14,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,018 INFO L225 Difference]: With dead ends: 238 [2019-09-09 05:50:14,019 INFO L226 Difference]: Without dead ends: 238 [2019-09-09 05:50:14,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-09 05:50:14,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-09-09 05:50:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-09 05:50:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2019-09-09 05:50:14,028 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2019-09-09 05:50:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:14,029 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2019-09-09 05:50:14,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2019-09-09 05:50:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:50:14,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:14,030 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:14,030 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:14,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:14,031 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2019-09-09 05:50:14,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:14,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:14,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:14,051 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-09 05:50:14,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:14,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:14,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:14,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:14,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:14,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,053 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2019-09-09 05:50:14,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,069 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2019-09-09 05:50:14,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:50:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,072 INFO L225 Difference]: With dead ends: 426 [2019-09-09 05:50:14,072 INFO L226 Difference]: Without dead ends: 426 [2019-09-09 05:50:14,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-09-09 05:50:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2019-09-09 05:50:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-09 05:50:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-09-09 05:50:14,083 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2019-09-09 05:50:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:14,083 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-09-09 05:50:14,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-09-09 05:50:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:50:14,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:14,084 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:14,085 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2019-09-09 05:50:14,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:14,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:14,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:14,104 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-09 05:50:14,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:14,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:14,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:14,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:14,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:14,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,106 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2019-09-09 05:50:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,130 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2019-09-09 05:50:14,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:50:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,134 INFO L225 Difference]: With dead ends: 450 [2019-09-09 05:50:14,134 INFO L226 Difference]: Without dead ends: 450 [2019-09-09 05:50:14,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-09-09 05:50:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-09-09 05:50:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-09 05:50:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2019-09-09 05:50:14,146 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2019-09-09 05:50:14,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:14,146 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2019-09-09 05:50:14,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2019-09-09 05:50:14,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:50:14,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:14,147 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:14,148 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:14,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2019-09-09 05:50:14,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:14,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:14,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:14,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:14,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:14,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:14,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,179 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2019-09-09 05:50:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,193 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2019-09-09 05:50:14,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:50:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,196 INFO L225 Difference]: With dead ends: 458 [2019-09-09 05:50:14,196 INFO L226 Difference]: Without dead ends: 458 [2019-09-09 05:50:14,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-09 05:50:14,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2019-09-09 05:50:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-09 05:50:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2019-09-09 05:50:14,208 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2019-09-09 05:50:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:14,208 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2019-09-09 05:50:14,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2019-09-09 05:50:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:50:14,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:14,209 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:14,210 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:14,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:14,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2019-09-09 05:50:14,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:14,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:14,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:14,227 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-09 05:50:14,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:14,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:14,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:14,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:14,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:14,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,229 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2019-09-09 05:50:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,244 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2019-09-09 05:50:14,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:50:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,249 INFO L225 Difference]: With dead ends: 810 [2019-09-09 05:50:14,249 INFO L226 Difference]: Without dead ends: 810 [2019-09-09 05:50:14,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-09-09 05:50:14,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2019-09-09 05:50:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-09 05:50:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2019-09-09 05:50:14,265 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2019-09-09 05:50:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:14,265 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2019-09-09 05:50:14,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2019-09-09 05:50:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:50:14,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:14,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:14,267 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:14,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2019-09-09 05:50:14,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:14,286 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-09 05:50:14,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:14,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:14,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:14,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:14,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:14,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,288 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2019-09-09 05:50:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,305 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2019-09-09 05:50:14,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:50:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,310 INFO L225 Difference]: With dead ends: 874 [2019-09-09 05:50:14,310 INFO L226 Difference]: Without dead ends: 874 [2019-09-09 05:50:14,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-09 05:50:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2019-09-09 05:50:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-09-09 05:50:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2019-09-09 05:50:14,331 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2019-09-09 05:50:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:14,331 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2019-09-09 05:50:14,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2019-09-09 05:50:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:50:14,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:14,333 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:14,333 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:14,334 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2019-09-09 05:50:14,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:14,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:14,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:14,350 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-09 05:50:14,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:14,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:14,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:14,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:14,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:14,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,352 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2019-09-09 05:50:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,367 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2019-09-09 05:50:14,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:50:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,372 INFO L225 Difference]: With dead ends: 890 [2019-09-09 05:50:14,372 INFO L226 Difference]: Without dead ends: 890 [2019-09-09 05:50:14,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-09-09 05:50:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2019-09-09 05:50:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-09-09 05:50:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2019-09-09 05:50:14,395 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2019-09-09 05:50:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:14,395 INFO L475 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2019-09-09 05:50:14,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2019-09-09 05:50:14,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:50:14,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:14,397 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:14,397 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:14,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:14,398 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2019-09-09 05:50:14,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:14,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:14,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:14,419 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-09 05:50:14,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:14,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:14,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:14,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:14,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:14,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,421 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2019-09-09 05:50:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,444 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2019-09-09 05:50:14,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:50:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,452 INFO L225 Difference]: With dead ends: 1546 [2019-09-09 05:50:14,452 INFO L226 Difference]: Without dead ends: 1546 [2019-09-09 05:50:14,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-09-09 05:50:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2019-09-09 05:50:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-09-09 05:50:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2019-09-09 05:50:14,488 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2019-09-09 05:50:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:14,488 INFO L475 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2019-09-09 05:50:14,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2019-09-09 05:50:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:50:14,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:14,491 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:14,491 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:14,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:14,492 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2019-09-09 05:50:14,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:14,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:14,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:14,516 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-09 05:50:14,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:14,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:14,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:14,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:14,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:14,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,517 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2019-09-09 05:50:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,547 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2019-09-09 05:50:14,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:50:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,559 INFO L225 Difference]: With dead ends: 1706 [2019-09-09 05:50:14,559 INFO L226 Difference]: Without dead ends: 1706 [2019-09-09 05:50:14,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-09-09 05:50:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2019-09-09 05:50:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-09-09 05:50:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2019-09-09 05:50:14,615 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2019-09-09 05:50:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:14,615 INFO L475 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2019-09-09 05:50:14,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2019-09-09 05:50:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:50:14,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:14,619 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:14,620 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:14,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:14,620 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2019-09-09 05:50:14,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:14,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:14,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:14,645 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-09 05:50:14,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:14,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:14,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:14,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:14,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,650 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2019-09-09 05:50:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,685 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2019-09-09 05:50:14,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:50:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,694 INFO L225 Difference]: With dead ends: 1738 [2019-09-09 05:50:14,694 INFO L226 Difference]: Without dead ends: 1738 [2019-09-09 05:50:14,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-09-09 05:50:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2019-09-09 05:50:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-09-09 05:50:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2019-09-09 05:50:14,732 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2019-09-09 05:50:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:14,733 INFO L475 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2019-09-09 05:50:14,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2019-09-09 05:50:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:50:14,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:14,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:14,736 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:14,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:14,737 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2019-09-09 05:50:14,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:14,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:14,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:14,757 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-09 05:50:14,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:14,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:14,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:14,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:14,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:14,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,761 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2019-09-09 05:50:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,789 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2019-09-09 05:50:14,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:50:14,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,802 INFO L225 Difference]: With dead ends: 2954 [2019-09-09 05:50:14,803 INFO L226 Difference]: Without dead ends: 2954 [2019-09-09 05:50:14,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-09-09 05:50:14,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2019-09-09 05:50:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-09-09 05:50:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2019-09-09 05:50:14,860 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2019-09-09 05:50:14,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:14,861 INFO L475 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2019-09-09 05:50:14,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2019-09-09 05:50:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:50:14,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:14,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:14,866 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:14,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:14,866 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2019-09-09 05:50:14,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:14,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:14,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:14,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:14,886 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-09 05:50:14,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:14,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:14,887 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:14,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:14,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:14,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,888 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2019-09-09 05:50:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:14,921 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2019-09-09 05:50:14,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:14,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:50:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:14,936 INFO L225 Difference]: With dead ends: 3338 [2019-09-09 05:50:14,936 INFO L226 Difference]: Without dead ends: 3338 [2019-09-09 05:50:14,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:14,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-09-09 05:50:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2019-09-09 05:50:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-09-09 05:50:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2019-09-09 05:50:15,010 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2019-09-09 05:50:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:15,010 INFO L475 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2019-09-09 05:50:15,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2019-09-09 05:50:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:50:15,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:15,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:15,016 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:15,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:15,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2019-09-09 05:50:15,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:15,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:15,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:15,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:15,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:15,034 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-09 05:50:15,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:15,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:15,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:15,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:15,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:15,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:15,036 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2019-09-09 05:50:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:15,067 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2019-09-09 05:50:15,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:15,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:50:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:15,089 INFO L225 Difference]: With dead ends: 3402 [2019-09-09 05:50:15,090 INFO L226 Difference]: Without dead ends: 3402 [2019-09-09 05:50:15,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:15,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-09-09 05:50:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2019-09-09 05:50:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2019-09-09 05:50:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2019-09-09 05:50:15,190 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2019-09-09 05:50:15,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:15,190 INFO L475 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2019-09-09 05:50:15,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2019-09-09 05:50:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:50:15,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:15,197 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:15,197 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:15,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:15,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2019-09-09 05:50:15,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:15,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:15,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:15,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:15,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:15,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:15,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:15,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:15,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:15,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:15,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:15,236 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2019-09-09 05:50:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:15,291 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2019-09-09 05:50:15,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:15,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:50:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:15,362 INFO L225 Difference]: With dead ends: 6538 [2019-09-09 05:50:15,363 INFO L226 Difference]: Without dead ends: 6538 [2019-09-09 05:50:15,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:15,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-09-09 05:50:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2019-09-09 05:50:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-09-09 05:50:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2019-09-09 05:50:15,580 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2019-09-09 05:50:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:15,580 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2019-09-09 05:50:15,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2019-09-09 05:50:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:50:15,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:15,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:15,590 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:15,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:15,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2019-09-09 05:50:15,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:15,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:15,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:15,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:15,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:15,614 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-09 05:50:15,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:15,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:15,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:15,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:15,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:15,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:15,615 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2019-09-09 05:50:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:15,658 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2019-09-09 05:50:15,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:15,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:50:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:15,675 INFO L225 Difference]: With dead ends: 7050 [2019-09-09 05:50:15,675 INFO L226 Difference]: Without dead ends: 7050 [2019-09-09 05:50:15,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:15,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-09-09 05:50:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2019-09-09 05:50:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-09-09 05:50:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2019-09-09 05:50:15,799 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2019-09-09 05:50:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:15,799 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2019-09-09 05:50:15,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2019-09-09 05:50:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:50:15,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:15,815 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:15,817 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:15,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:15,817 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2019-09-09 05:50:15,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:15,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:15,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:15,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:15,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:15,838 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-09 05:50:15,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:15,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:15,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:15,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:15,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:15,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:15,840 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2019-09-09 05:50:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:15,903 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2019-09-09 05:50:15,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:15,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:50:15,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:15,930 INFO L225 Difference]: With dead ends: 10632 [2019-09-09 05:50:15,931 INFO L226 Difference]: Without dead ends: 10632 [2019-09-09 05:50:15,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2019-09-09 05:50:16,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2019-09-09 05:50:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2019-09-09 05:50:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2019-09-09 05:50:16,181 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2019-09-09 05:50:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:16,182 INFO L475 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2019-09-09 05:50:16,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2019-09-09 05:50:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:50:16,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:16,201 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:16,201 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:16,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:16,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2019-09-09 05:50:16,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:16,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:16,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:16,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:16,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:16,221 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-09 05:50:16,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:16,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:16,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:16,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:16,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:16,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:16,223 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2019-09-09 05:50:16,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:16,281 INFO L93 Difference]: Finished difference Result 12678 states and 13829 transitions. [2019-09-09 05:50:16,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:16,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:50:16,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:16,282 INFO L225 Difference]: With dead ends: 12678 [2019-09-09 05:50:16,282 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:50:16,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:16,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:50:16,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:50:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:50:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:50:16,283 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-09-09 05:50:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:16,283 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:50:16,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:50:16,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:50:16,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:50:16 BoogieIcfgContainer [2019-09-09 05:50:16,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:50:16,295 INFO L168 Benchmark]: Toolchain (without parser) took 4467.50 ms. Allocated memory was 132.6 MB in the beginning and 335.0 MB in the end (delta: 202.4 MB). Free memory was 87.9 MB in the beginning and 220.5 MB in the end (delta: -132.6 MB). Peak memory consumption was 69.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:16,296 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory was 105.8 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:50:16,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.22 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 87.5 MB in the beginning and 175.8 MB in the end (delta: -88.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:16,298 INFO L168 Benchmark]: Boogie Preprocessor took 35.96 ms. Allocated memory is still 199.8 MB. Free memory was 175.8 MB in the beginning and 174.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:16,302 INFO L168 Benchmark]: RCFGBuilder took 394.72 ms. Allocated memory is still 199.8 MB. Free memory was 174.0 MB in the beginning and 156.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:16,302 INFO L168 Benchmark]: TraceAbstraction took 3655.42 ms. Allocated memory was 199.8 MB in the beginning and 335.0 MB in the end (delta: 135.3 MB). Free memory was 155.8 MB in the beginning and 220.5 MB in the end (delta: -64.7 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:16,313 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory was 105.8 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 377.22 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 87.5 MB in the beginning and 175.8 MB in the end (delta: -88.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.96 ms. Allocated memory is still 199.8 MB. Free memory was 175.8 MB in the beginning and 174.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 394.72 ms. Allocated memory is still 199.8 MB. Free memory was 174.0 MB in the beginning and 156.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3655.42 ms. Allocated memory was 199.8 MB in the beginning and 335.0 MB in the end (delta: 135.3 MB). Free memory was 155.8 MB in the beginning and 220.5 MB in the end (delta: -64.7 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...