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_13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:30:52,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:30:52,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:30:52,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:30:52,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:30:52,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:30:52,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:30:52,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:30:52,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:30:52,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:30:52,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:30:52,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:30:52,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:30:52,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:30:52,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:30:52,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:30:52,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:30:52,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:30:52,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:30:52,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:30:52,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:30:52,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:30:52,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:30:52,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:30:52,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:30:52,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:30:52,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:30:52,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:30:52,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:30:52,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:30:52,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:30:52,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:30:52,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:30:52,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:30:52,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:30:52,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:30:52,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:30:52,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:30:52,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:30:52,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:30:52,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:30:52,119 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-10-03 02:30:52,155 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:30:52,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:30:52,157 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:30:52,157 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:30:52,160 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:30:52,160 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:30:52,160 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:30:52,160 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:30:52,161 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:30:52,161 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:30:52,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:30:52,163 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:30:52,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:30:52,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:30:52,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:30:52,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:30:52,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:30:52,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:30:52,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:30:52,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:30:52,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:30:52,165 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:30:52,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:30:52,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:30:52,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:30:52,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:30:52,166 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:30:52,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:30:52,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:30:52,166 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:30:52,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:30:52,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:30:52,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:30:52,215 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:30:52,216 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:30:52,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2019-10-03 02:30:52,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453362937/463bbb9305514dad8dbdd997000cce37/FLAGbed777125 [2019-10-03 02:30:52,786 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:30:52,787 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-10-03 02:30:52,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453362937/463bbb9305514dad8dbdd997000cce37/FLAGbed777125 [2019-10-03 02:30:53,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453362937/463bbb9305514dad8dbdd997000cce37 [2019-10-03 02:30:53,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:30:53,185 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:30:53,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:30:53,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:30:53,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:30:53,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:30:53" (1/1) ... [2019-10-03 02:30:53,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371dfc2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:53, skipping insertion in model container [2019-10-03 02:30:53,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:30:53" (1/1) ... [2019-10-03 02:30:53,203 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:30:53,241 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:30:53,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:30:53,448 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:30:53,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:30:53,594 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:30:53,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:53 WrapperNode [2019-10-03 02:30:53,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:30:53,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:30:53,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:30:53,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:30:53,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:53" (1/1) ... [2019-10-03 02:30:53,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:53" (1/1) ... [2019-10-03 02:30:53,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:53" (1/1) ... [2019-10-03 02:30:53,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:53" (1/1) ... [2019-10-03 02:30:53,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:53" (1/1) ... [2019-10-03 02:30:53,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:53" (1/1) ... [2019-10-03 02:30:53,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:53" (1/1) ... [2019-10-03 02:30:53,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:30:53,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:30:53,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:30:53,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:30:53,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:53" (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-10-03 02:30:53,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:30:53,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:30:53,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:30:53,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:30:53,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:30:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:30:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:30:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:30:54,062 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:30:54,063 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:30:54,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:30:54 BoogieIcfgContainer [2019-10-03 02:30:54,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:30:54,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:30:54,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:30:54,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:30:54,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:30:53" (1/3) ... [2019-10-03 02:30:54,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237059a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:30:54, skipping insertion in model container [2019-10-03 02:30:54,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:53" (2/3) ... [2019-10-03 02:30:54,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237059a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:30:54, skipping insertion in model container [2019-10-03 02:30:54,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:30:54" (3/3) ... [2019-10-03 02:30:54,075 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-10-03 02:30:54,086 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:30:54,095 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:30:54,113 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:30:54,145 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:30:54,145 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:30:54,146 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:30:54,146 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:30:54,149 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:30:54,149 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:30:54,149 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:30:54,149 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:30:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-10-03 02:30:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:30:54,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:54,206 INFO L411 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-10-03 02:30:54,212 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:54,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:54,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2019-10-03 02:30:54,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:54,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:54,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:54,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:54,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:54,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:54,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:54,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:54,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:54,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:54,546 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-10-03 02:30:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:54,623 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2019-10-03 02:30:54,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:54,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-03 02:30:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:54,639 INFO L225 Difference]: With dead ends: 98 [2019-10-03 02:30:54,639 INFO L226 Difference]: Without dead ends: 90 [2019-10-03 02:30:54,641 INFO L640 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-10-03 02:30:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-03 02:30:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2019-10-03 02:30:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-03 02:30:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2019-10-03 02:30:54,686 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2019-10-03 02:30:54,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:54,687 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2019-10-03 02:30:54,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2019-10-03 02:30:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:30:54,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:54,689 INFO L411 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-10-03 02:30:54,689 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:54,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:54,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2019-10-03 02:30:54,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:54,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:54,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:54,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:54,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:54,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:54,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:54,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:54,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:54,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:54,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:54,777 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2019-10-03 02:30:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:54,831 INFO L93 Difference]: Finished difference Result 90 states and 162 transitions. [2019-10-03 02:30:54,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:54,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-03 02:30:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:54,834 INFO L225 Difference]: With dead ends: 90 [2019-10-03 02:30:54,834 INFO L226 Difference]: Without dead ends: 90 [2019-10-03 02:30:54,836 INFO L640 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-10-03 02:30:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-03 02:30:54,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-10-03 02:30:54,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-03 02:30:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2019-10-03 02:30:54,855 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2019-10-03 02:30:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:54,855 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2019-10-03 02:30:54,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2019-10-03 02:30:54,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-03 02:30:54,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:54,857 INFO L411 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-10-03 02:30:54,858 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2019-10-03 02:30:54,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:54,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:54,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:54,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:54,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:54,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:54,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:54,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:54,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:54,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:54,933 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2019-10-03 02:30:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:54,968 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2019-10-03 02:30:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:54,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-03 02:30:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:54,973 INFO L225 Difference]: With dead ends: 93 [2019-10-03 02:30:54,974 INFO L226 Difference]: Without dead ends: 93 [2019-10-03 02:30:54,974 INFO L640 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-10-03 02:30:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-03 02:30:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-10-03 02:30:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-03 02:30:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2019-10-03 02:30:54,987 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2019-10-03 02:30:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:54,989 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2019-10-03 02:30:54,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2019-10-03 02:30:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-03 02:30:54,990 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:54,991 INFO L411 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-10-03 02:30:54,991 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:54,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:54,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2019-10-03 02:30:54,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:54,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:54,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:54,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:54,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:55,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:55,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:55,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:55,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:55,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:55,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:55,040 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2019-10-03 02:30:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:55,059 INFO L93 Difference]: Finished difference Result 170 states and 309 transitions. [2019-10-03 02:30:55,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:55,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-03 02:30:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:55,062 INFO L225 Difference]: With dead ends: 170 [2019-10-03 02:30:55,062 INFO L226 Difference]: Without dead ends: 170 [2019-10-03 02:30:55,063 INFO L640 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-10-03 02:30:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-03 02:30:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2019-10-03 02:30:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-03 02:30:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2019-10-03 02:30:55,082 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2019-10-03 02:30:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:55,083 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2019-10-03 02:30:55,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2019-10-03 02:30:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-03 02:30:55,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:55,085 INFO L411 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-10-03 02:30:55,085 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:55,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2019-10-03 02:30:55,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:55,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:55,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:55,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:55,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:55,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:55,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:55,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:55,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:55,134 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2019-10-03 02:30:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:55,154 INFO L93 Difference]: Finished difference Result 172 states and 307 transitions. [2019-10-03 02:30:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:55,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-03 02:30:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:55,157 INFO L225 Difference]: With dead ends: 172 [2019-10-03 02:30:55,157 INFO L226 Difference]: Without dead ends: 172 [2019-10-03 02:30:55,158 INFO L640 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-10-03 02:30:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-03 02:30:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-10-03 02:30:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-03 02:30:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2019-10-03 02:30:55,173 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2019-10-03 02:30:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:55,173 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2019-10-03 02:30:55,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2019-10-03 02:30:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:30:55,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:55,176 INFO L411 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-10-03 02:30:55,177 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:55,177 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2019-10-03 02:30:55,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:55,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:55,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:55,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:55,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:55,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:55,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:55,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:55,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:55,256 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2019-10-03 02:30:55,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:55,273 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2019-10-03 02:30:55,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:55,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:30:55,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:55,275 INFO L225 Difference]: With dead ends: 174 [2019-10-03 02:30:55,275 INFO L226 Difference]: Without dead ends: 174 [2019-10-03 02:30:55,275 INFO L640 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-10-03 02:30:55,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-03 02:30:55,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-10-03 02:30:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-03 02:30:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2019-10-03 02:30:55,286 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2019-10-03 02:30:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:55,287 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2019-10-03 02:30:55,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2019-10-03 02:30:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:30:55,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:55,289 INFO L411 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-10-03 02:30:55,289 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:55,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:55,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2019-10-03 02:30:55,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:55,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:55,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:55,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:55,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:55,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:55,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:55,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:55,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:55,348 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2019-10-03 02:30:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:55,376 INFO L93 Difference]: Finished difference Result 322 states and 579 transitions. [2019-10-03 02:30:55,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:55,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:30:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:55,379 INFO L225 Difference]: With dead ends: 322 [2019-10-03 02:30:55,379 INFO L226 Difference]: Without dead ends: 322 [2019-10-03 02:30:55,380 INFO L640 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-10-03 02:30:55,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-03 02:30:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2019-10-03 02:30:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-03 02:30:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-10-03 02:30:55,393 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2019-10-03 02:30:55,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:55,399 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-10-03 02:30:55,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-10-03 02:30:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:30:55,417 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:55,417 INFO L411 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-10-03 02:30:55,417 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:55,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:55,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2019-10-03 02:30:55,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:55,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:55,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:55,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:55,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:55,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:55,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:55,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:55,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:55,458 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2019-10-03 02:30:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:55,482 INFO L93 Difference]: Finished difference Result 330 states and 579 transitions. [2019-10-03 02:30:55,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:55,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:30:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:55,486 INFO L225 Difference]: With dead ends: 330 [2019-10-03 02:30:55,486 INFO L226 Difference]: Without dead ends: 330 [2019-10-03 02:30:55,487 INFO L640 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-10-03 02:30:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-03 02:30:55,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-10-03 02:30:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-03 02:30:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2019-10-03 02:30:55,498 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2019-10-03 02:30:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:55,498 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2019-10-03 02:30:55,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2019-10-03 02:30:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:30:55,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:55,502 INFO L411 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-10-03 02:30:55,502 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:55,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:55,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2019-10-03 02:30:55,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:55,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:55,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:55,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:55,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:55,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:55,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:55,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:55,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:55,538 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2019-10-03 02:30:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:55,558 INFO L93 Difference]: Finished difference Result 334 states and 579 transitions. [2019-10-03 02:30:55,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:55,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:30:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:55,560 INFO L225 Difference]: With dead ends: 334 [2019-10-03 02:30:55,561 INFO L226 Difference]: Without dead ends: 334 [2019-10-03 02:30:55,561 INFO L640 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-10-03 02:30:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-03 02:30:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-10-03 02:30:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-10-03 02:30:55,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2019-10-03 02:30:55,570 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2019-10-03 02:30:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:55,570 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2019-10-03 02:30:55,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:55,571 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2019-10-03 02:30:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:30:55,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:55,572 INFO L411 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-10-03 02:30:55,572 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:55,573 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2019-10-03 02:30:55,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:55,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:55,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:55,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-10-03 02:30:55,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:55,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:55,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:55,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:55,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:55,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:55,608 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2019-10-03 02:30:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:55,626 INFO L93 Difference]: Finished difference Result 618 states and 1087 transitions. [2019-10-03 02:30:55,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:55,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:30:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:55,630 INFO L225 Difference]: With dead ends: 618 [2019-10-03 02:30:55,630 INFO L226 Difference]: Without dead ends: 618 [2019-10-03 02:30:55,630 INFO L640 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-10-03 02:30:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-03 02:30:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2019-10-03 02:30:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-03 02:30:55,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2019-10-03 02:30:55,647 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2019-10-03 02:30:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:55,650 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2019-10-03 02:30:55,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:55,650 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2019-10-03 02:30:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:30:55,654 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:55,654 INFO L411 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-10-03 02:30:55,654 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:55,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:55,655 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2019-10-03 02:30:55,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:55,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:55,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:55,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:55,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:55,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:55,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:55,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:55,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:55,703 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2019-10-03 02:30:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:55,725 INFO L93 Difference]: Finished difference Result 642 states and 1095 transitions. [2019-10-03 02:30:55,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:55,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:30:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:55,731 INFO L225 Difference]: With dead ends: 642 [2019-10-03 02:30:55,731 INFO L226 Difference]: Without dead ends: 642 [2019-10-03 02:30:55,731 INFO L640 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-10-03 02:30:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-03 02:30:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-10-03 02:30:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-10-03 02:30:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2019-10-03 02:30:55,748 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2019-10-03 02:30:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:55,748 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2019-10-03 02:30:55,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2019-10-03 02:30:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:30:55,750 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:55,750 INFO L411 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-10-03 02:30:55,750 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2019-10-03 02:30:55,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:55,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:55,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:55,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:55,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:55,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:55,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:55,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:55,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:55,790 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2019-10-03 02:30:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:55,813 INFO L93 Difference]: Finished difference Result 650 states and 1095 transitions. [2019-10-03 02:30:55,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:55,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:30:55,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:55,817 INFO L225 Difference]: With dead ends: 650 [2019-10-03 02:30:55,817 INFO L226 Difference]: Without dead ends: 650 [2019-10-03 02:30:55,818 INFO L640 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-10-03 02:30:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-03 02:30:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-10-03 02:30:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-03 02:30:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2019-10-03 02:30:55,835 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2019-10-03 02:30:55,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:55,836 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2019-10-03 02:30:55,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2019-10-03 02:30:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:30:55,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:55,838 INFO L411 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-10-03 02:30:55,838 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:55,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:55,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2019-10-03 02:30:55,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:55,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:55,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:55,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:55,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:55,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:55,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:55,876 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2019-10-03 02:30:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:55,897 INFO L93 Difference]: Finished difference Result 1194 states and 2039 transitions. [2019-10-03 02:30:55,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:55,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:30:55,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:55,905 INFO L225 Difference]: With dead ends: 1194 [2019-10-03 02:30:55,905 INFO L226 Difference]: Without dead ends: 1194 [2019-10-03 02:30:55,905 INFO L640 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-10-03 02:30:55,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-10-03 02:30:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2019-10-03 02:30:55,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-03 02:30:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2019-10-03 02:30:55,929 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2019-10-03 02:30:55,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:55,930 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2019-10-03 02:30:55,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2019-10-03 02:30:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:30:55,933 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:55,933 INFO L411 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-10-03 02:30:55,933 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:55,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:55,934 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2019-10-03 02:30:55,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:55,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:55,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:55,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:55,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:55,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:55,974 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:55,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:55,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:55,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:55,975 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2019-10-03 02:30:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:55,997 INFO L93 Difference]: Finished difference Result 1258 states and 2071 transitions. [2019-10-03 02:30:55,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:55,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:30:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:56,004 INFO L225 Difference]: With dead ends: 1258 [2019-10-03 02:30:56,004 INFO L226 Difference]: Without dead ends: 1258 [2019-10-03 02:30:56,005 INFO L640 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-10-03 02:30:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-03 02:30:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-10-03 02:30:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-10-03 02:30:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2019-10-03 02:30:56,034 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2019-10-03 02:30:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:56,035 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2019-10-03 02:30:56,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2019-10-03 02:30:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:30:56,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:56,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:56,037 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:56,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:56,038 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2019-10-03 02:30:56,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:56,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:56,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:56,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:56,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:56,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:56,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:56,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:56,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:56,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:56,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:56,075 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2019-10-03 02:30:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:56,101 INFO L93 Difference]: Finished difference Result 1274 states and 2071 transitions. [2019-10-03 02:30:56,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:56,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:30:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:56,108 INFO L225 Difference]: With dead ends: 1274 [2019-10-03 02:30:56,109 INFO L226 Difference]: Without dead ends: 1274 [2019-10-03 02:30:56,109 INFO L640 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-10-03 02:30:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-10-03 02:30:56,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-10-03 02:30:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-10-03 02:30:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2019-10-03 02:30:56,144 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2019-10-03 02:30:56,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:56,144 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2019-10-03 02:30:56,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2019-10-03 02:30:56,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:30:56,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:56,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:56,147 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:56,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2019-10-03 02:30:56,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:56,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:56,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:56,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:56,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:56,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:56,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:56,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:56,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:56,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:56,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:56,174 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2019-10-03 02:30:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:56,214 INFO L93 Difference]: Finished difference Result 2314 states and 3815 transitions. [2019-10-03 02:30:56,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:56,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:30:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:56,225 INFO L225 Difference]: With dead ends: 2314 [2019-10-03 02:30:56,225 INFO L226 Difference]: Without dead ends: 2314 [2019-10-03 02:30:56,226 INFO L640 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-10-03 02:30:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-10-03 02:30:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2019-10-03 02:30:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-10-03 02:30:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2019-10-03 02:30:56,286 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2019-10-03 02:30:56,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:56,287 INFO L475 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2019-10-03 02:30:56,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2019-10-03 02:30:56,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:30:56,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:56,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:56,292 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:56,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:56,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2019-10-03 02:30:56,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:56,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:56,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:56,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:56,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:56,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:56,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:56,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:56,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:56,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:56,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:56,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:56,316 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2019-10-03 02:30:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:56,357 INFO L93 Difference]: Finished difference Result 2474 states and 3911 transitions. [2019-10-03 02:30:56,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:56,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:30:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:56,372 INFO L225 Difference]: With dead ends: 2474 [2019-10-03 02:30:56,372 INFO L226 Difference]: Without dead ends: 2474 [2019-10-03 02:30:56,373 INFO L640 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-10-03 02:30:56,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-10-03 02:30:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2019-10-03 02:30:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-10-03 02:30:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2019-10-03 02:30:56,443 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2019-10-03 02:30:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:56,444 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2019-10-03 02:30:56,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2019-10-03 02:30:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:30:56,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:56,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:56,450 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:56,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:56,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2019-10-03 02:30:56,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:56,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:56,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:56,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:56,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:56,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:56,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:56,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:56,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:56,476 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2019-10-03 02:30:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:56,514 INFO L93 Difference]: Finished difference Result 2506 states and 3911 transitions. [2019-10-03 02:30:56,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:56,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 02:30:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:56,528 INFO L225 Difference]: With dead ends: 2506 [2019-10-03 02:30:56,528 INFO L226 Difference]: Without dead ends: 2506 [2019-10-03 02:30:56,529 INFO L640 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-10-03 02:30:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-10-03 02:30:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-10-03 02:30:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-10-03 02:30:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2019-10-03 02:30:56,608 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2019-10-03 02:30:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:56,608 INFO L475 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2019-10-03 02:30:56,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2019-10-03 02:30:56,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:30:56,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:56,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:56,614 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:56,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:56,614 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2019-10-03 02:30:56,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:56,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:56,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:56,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:56,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:56,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:56,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:56,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:56,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:56,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:56,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:56,639 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2019-10-03 02:30:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:56,685 INFO L93 Difference]: Finished difference Result 4490 states and 7111 transitions. [2019-10-03 02:30:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:56,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 02:30:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:56,708 INFO L225 Difference]: With dead ends: 4490 [2019-10-03 02:30:56,708 INFO L226 Difference]: Without dead ends: 4490 [2019-10-03 02:30:56,708 INFO L640 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-10-03 02:30:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-10-03 02:30:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2019-10-03 02:30:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-10-03 02:30:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2019-10-03 02:30:56,805 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2019-10-03 02:30:56,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:56,805 INFO L475 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2019-10-03 02:30:56,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2019-10-03 02:30:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:30:56,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:56,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:56,812 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:56,812 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2019-10-03 02:30:56,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:56,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:56,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:56,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:56,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:56,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:56,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:56,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:56,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:56,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:56,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:56,834 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2019-10-03 02:30:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:56,880 INFO L93 Difference]: Finished difference Result 4874 states and 7367 transitions. [2019-10-03 02:30:56,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:56,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 02:30:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:56,916 INFO L225 Difference]: With dead ends: 4874 [2019-10-03 02:30:56,916 INFO L226 Difference]: Without dead ends: 4874 [2019-10-03 02:30:56,916 INFO L640 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-10-03 02:30:56,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-10-03 02:30:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2019-10-03 02:30:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2019-10-03 02:30:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2019-10-03 02:30:57,074 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2019-10-03 02:30:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:57,074 INFO L475 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2019-10-03 02:30:57,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2019-10-03 02:30:57,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:30:57,081 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:57,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:57,081 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:57,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:57,081 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2019-10-03 02:30:57,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:57,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:57,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:57,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:57,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:57,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:57,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:57,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:57,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:57,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:57,102 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2019-10-03 02:30:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:57,133 INFO L93 Difference]: Finished difference Result 4938 states and 7367 transitions. [2019-10-03 02:30:57,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:57,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 02:30:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:57,145 INFO L225 Difference]: With dead ends: 4938 [2019-10-03 02:30:57,145 INFO L226 Difference]: Without dead ends: 4938 [2019-10-03 02:30:57,146 INFO L640 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-10-03 02:30:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2019-10-03 02:30:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2019-10-03 02:30:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2019-10-03 02:30:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2019-10-03 02:30:57,233 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2019-10-03 02:30:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:57,234 INFO L475 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2019-10-03 02:30:57,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2019-10-03 02:30:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:30:57,240 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:57,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:57,241 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:57,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2019-10-03 02:30:57,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:57,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:57,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:57,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:57,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:57,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:57,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:57,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:57,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:57,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:57,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:57,261 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2019-10-03 02:30:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:57,302 INFO L93 Difference]: Finished difference Result 9610 states and 13959 transitions. [2019-10-03 02:30:57,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:57,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 02:30:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:57,323 INFO L225 Difference]: With dead ends: 9610 [2019-10-03 02:30:57,324 INFO L226 Difference]: Without dead ends: 9610 [2019-10-03 02:30:57,324 INFO L640 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-10-03 02:30:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2019-10-03 02:30:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2019-10-03 02:30:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-10-03 02:30:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2019-10-03 02:30:57,500 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2019-10-03 02:30:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:57,500 INFO L475 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2019-10-03 02:30:57,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2019-10-03 02:30:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:30:57,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:57,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:57,567 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:57,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:57,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2019-10-03 02:30:57,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:57,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:57,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:57,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:57,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:57,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:57,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:57,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:57,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:57,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:57,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:57,588 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2019-10-03 02:30:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:57,633 INFO L93 Difference]: Finished difference Result 11146 states and 16647 transitions. [2019-10-03 02:30:57,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:57,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 02:30:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:57,659 INFO L225 Difference]: With dead ends: 11146 [2019-10-03 02:30:57,659 INFO L226 Difference]: Without dead ends: 11146 [2019-10-03 02:30:57,659 INFO L640 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-10-03 02:30:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-10-03 02:30:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2019-10-03 02:30:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-10-03 02:30:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2019-10-03 02:30:57,833 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2019-10-03 02:30:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:57,834 INFO L475 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2019-10-03 02:30:57,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2019-10-03 02:30:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 02:30:57,848 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:57,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:57,849 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:57,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:57,849 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2019-10-03 02:30:57,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:57,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:57,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:57,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:57,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:57,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:57,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:57,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:57,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:57,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:57,873 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2019-10-03 02:30:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:57,948 INFO L93 Difference]: Finished difference Result 16778 states and 24455 transitions. [2019-10-03 02:30:57,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:57,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-03 02:30:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:57,987 INFO L225 Difference]: With dead ends: 16778 [2019-10-03 02:30:57,988 INFO L226 Difference]: Without dead ends: 16778 [2019-10-03 02:30:57,988 INFO L640 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-10-03 02:30:58,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2019-10-03 02:30:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2019-10-03 02:30:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-10-03 02:30:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2019-10-03 02:30:58,257 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2019-10-03 02:30:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:58,258 INFO L475 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2019-10-03 02:30:58,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2019-10-03 02:30:58,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 02:30:58,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:58,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:58,284 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2019-10-03 02:30:58,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:58,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:58,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:58,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:58,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:58,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:58,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:58,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:58,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:58,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:58,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:58,386 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2019-10-03 02:30:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:58,451 INFO L93 Difference]: Finished difference Result 18826 states and 26119 transitions. [2019-10-03 02:30:58,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:58,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-03 02:30:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:58,488 INFO L225 Difference]: With dead ends: 18826 [2019-10-03 02:30:58,488 INFO L226 Difference]: Without dead ends: 18826 [2019-10-03 02:30:58,489 INFO L640 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-10-03 02:30:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2019-10-03 02:30:58,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2019-10-03 02:30:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2019-10-03 02:30:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2019-10-03 02:30:58,739 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2019-10-03 02:30:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:58,739 INFO L475 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2019-10-03 02:30:58,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2019-10-03 02:30:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 02:30:58,761 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:58,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:58,761 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:58,762 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2019-10-03 02:30:58,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:58,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:58,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:58,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:58,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:58,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:58,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:58,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:58,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:58,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:58,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:58,782 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2019-10-03 02:30:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:58,857 INFO L93 Difference]: Finished difference Result 19210 states and 26375 transitions. [2019-10-03 02:30:58,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:58,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-03 02:30:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:58,892 INFO L225 Difference]: With dead ends: 19210 [2019-10-03 02:30:58,892 INFO L226 Difference]: Without dead ends: 19210 [2019-10-03 02:30:58,892 INFO L640 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-10-03 02:30:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2019-10-03 02:30:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2019-10-03 02:30:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2019-10-03 02:30:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2019-10-03 02:30:59,212 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2019-10-03 02:30:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:59,212 INFO L475 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2019-10-03 02:30:59,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2019-10-03 02:30:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 02:30:59,234 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:59,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:59,234 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:59,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:59,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2019-10-03 02:30:59,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:59,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:59,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:59,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:59,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:59,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:59,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:59,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:59,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:59,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:59,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:59,260 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2019-10-03 02:30:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:59,352 INFO L93 Difference]: Finished difference Result 32778 states and 45319 transitions. [2019-10-03 02:30:59,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:59,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-03 02:30:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:59,415 INFO L225 Difference]: With dead ends: 32778 [2019-10-03 02:30:59,416 INFO L226 Difference]: Without dead ends: 32778 [2019-10-03 02:30:59,416 INFO L640 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-10-03 02:30:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2019-10-03 02:31:00,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2019-10-03 02:31:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2019-10-03 02:31:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2019-10-03 02:31:00,547 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2019-10-03 02:31:00,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:00,547 INFO L475 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2019-10-03 02:31:00,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:00,548 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2019-10-03 02:31:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 02:31:00,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:00,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:00,585 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2019-10-03 02:31:00,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:00,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:00,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:00,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:00,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:00,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:00,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:00,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:00,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:00,606 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2019-10-03 02:31:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:00,715 INFO L93 Difference]: Finished difference Result 37386 states and 49159 transitions. [2019-10-03 02:31:00,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:00,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-03 02:31:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:00,783 INFO L225 Difference]: With dead ends: 37386 [2019-10-03 02:31:00,783 INFO L226 Difference]: Without dead ends: 37386 [2019-10-03 02:31:00,783 INFO L640 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-10-03 02:31:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2019-10-03 02:31:01,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2019-10-03 02:31:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2019-10-03 02:31:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2019-10-03 02:31:01,379 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2019-10-03 02:31:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:01,380 INFO L475 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2019-10-03 02:31:01,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2019-10-03 02:31:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-03 02:31:01,413 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:01,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:01,413 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:01,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2019-10-03 02:31:01,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:01,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:01,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:01,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:01,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:01,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:01,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:01,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:01,436 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2019-10-03 02:31:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:01,546 INFO L93 Difference]: Finished difference Result 37898 states and 49159 transitions. [2019-10-03 02:31:01,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:01,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-03 02:31:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:01,590 INFO L225 Difference]: With dead ends: 37898 [2019-10-03 02:31:01,591 INFO L226 Difference]: Without dead ends: 37898 [2019-10-03 02:31:01,591 INFO L640 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-10-03 02:31:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2019-10-03 02:31:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2019-10-03 02:31:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2019-10-03 02:31:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2019-10-03 02:31:02,024 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2019-10-03 02:31:02,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:02,025 INFO L475 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2019-10-03 02:31:02,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2019-10-03 02:31:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-03 02:31:02,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:02,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:02,048 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:02,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:02,049 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2019-10-03 02:31:02,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:02,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:02,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:02,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:02,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:02,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:02,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:02,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:02,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:02,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:02,070 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2019-10-03 02:31:03,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:03,072 INFO L93 Difference]: Finished difference Result 63498 states and 82439 transitions. [2019-10-03 02:31:03,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:03,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-03 02:31:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:03,143 INFO L225 Difference]: With dead ends: 63498 [2019-10-03 02:31:03,144 INFO L226 Difference]: Without dead ends: 63498 [2019-10-03 02:31:03,144 INFO L640 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-10-03 02:31:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2019-10-03 02:31:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2019-10-03 02:31:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2019-10-03 02:31:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2019-10-03 02:31:03,795 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2019-10-03 02:31:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:03,795 INFO L475 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2019-10-03 02:31:03,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2019-10-03 02:31:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-03 02:31:04,031 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:04,032 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:04,032 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2019-10-03 02:31:04,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:04,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:04,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:04,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:04,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-10-03 02:31:04,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:04,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:04,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:04,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:04,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:04,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:04,053 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2019-10-03 02:31:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:04,234 INFO L93 Difference]: Finished difference Result 73738 states and 91143 transitions. [2019-10-03 02:31:04,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:04,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-03 02:31:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:04,299 INFO L225 Difference]: With dead ends: 73738 [2019-10-03 02:31:04,299 INFO L226 Difference]: Without dead ends: 73738 [2019-10-03 02:31:04,299 INFO L640 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-10-03 02:31:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2019-10-03 02:31:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2019-10-03 02:31:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2019-10-03 02:31:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2019-10-03 02:31:04,902 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2019-10-03 02:31:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:04,903 INFO L475 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2019-10-03 02:31:04,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2019-10-03 02:31:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 02:31:06,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:06,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:06,246 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:06,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:06,246 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2019-10-03 02:31:06,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:06,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:06,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:06,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:06,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:06,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:06,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:06,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:06,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:06,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:06,268 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2019-10-03 02:31:06,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:06,477 INFO L93 Difference]: Finished difference Result 74762 states and 91143 transitions. [2019-10-03 02:31:06,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:06,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-03 02:31:06,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:06,554 INFO L225 Difference]: With dead ends: 74762 [2019-10-03 02:31:06,554 INFO L226 Difference]: Without dead ends: 74762 [2019-10-03 02:31:06,554 INFO L640 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-10-03 02:31:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2019-10-03 02:31:07,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2019-10-03 02:31:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2019-10-03 02:31:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2019-10-03 02:31:07,120 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2019-10-03 02:31:07,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:07,120 INFO L475 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2019-10-03 02:31:07,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2019-10-03 02:31:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 02:31:07,368 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:07,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:07,369 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:07,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:07,369 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2019-10-03 02:31:07,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:07,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:07,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:07,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:07,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:07,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:07,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:07,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:07,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:07,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:07,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:07,397 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2019-10-03 02:31:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:07,656 INFO L93 Difference]: Finished difference Result 122890 states and 148487 transitions. [2019-10-03 02:31:07,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:07,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-03 02:31:07,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:07,829 INFO L225 Difference]: With dead ends: 122890 [2019-10-03 02:31:07,829 INFO L226 Difference]: Without dead ends: 122890 [2019-10-03 02:31:07,831 INFO L640 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-10-03 02:31:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2019-10-03 02:31:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2019-10-03 02:31:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2019-10-03 02:31:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2019-10-03 02:31:10,868 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2019-10-03 02:31:10,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:10,868 INFO L475 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2019-10-03 02:31:10,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:10,868 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2019-10-03 02:31:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 02:31:10,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:10,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:10,942 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:10,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:10,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2019-10-03 02:31:10,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:10,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:10,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:10,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:10,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:10,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:10,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:10,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:10,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:10,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:10,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:10,963 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2019-10-03 02:31:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:11,330 INFO L93 Difference]: Finished difference Result 145418 states and 167943 transitions. [2019-10-03 02:31:11,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:11,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-03 02:31:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:11,512 INFO L225 Difference]: With dead ends: 145418 [2019-10-03 02:31:11,513 INFO L226 Difference]: Without dead ends: 145418 [2019-10-03 02:31:11,513 INFO L640 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-10-03 02:31:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2019-10-03 02:31:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2019-10-03 02:31:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2019-10-03 02:31:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2019-10-03 02:31:13,025 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2019-10-03 02:31:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:13,025 INFO L475 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2019-10-03 02:31:13,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2019-10-03 02:31:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 02:31:13,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:13,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:13,103 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:13,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:13,104 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2019-10-03 02:31:13,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:13,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:13,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:13,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:13,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:13,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:13,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:13,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:13,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:13,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:13,128 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2019-10-03 02:31:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:13,531 INFO L93 Difference]: Finished difference Result 147466 states and 167943 transitions. [2019-10-03 02:31:13,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:13,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-03 02:31:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:13,714 INFO L225 Difference]: With dead ends: 147466 [2019-10-03 02:31:13,714 INFO L226 Difference]: Without dead ends: 147466 [2019-10-03 02:31:13,715 INFO L640 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-10-03 02:31:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2019-10-03 02:31:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2019-10-03 02:31:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2019-10-03 02:31:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2019-10-03 02:31:17,210 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2019-10-03 02:31:17,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:17,211 INFO L475 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2019-10-03 02:31:17,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2019-10-03 02:31:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 02:31:17,274 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:17,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:17,274 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:17,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:17,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2019-10-03 02:31:17,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:17,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:17,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:17,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:17,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:17,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:17,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:17,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:17,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:17,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:17,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:17,296 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2019-10-03 02:31:18,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:18,390 INFO L93 Difference]: Finished difference Result 237576 states and 264198 transitions. [2019-10-03 02:31:18,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:18,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-03 02:31:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:18,616 INFO L225 Difference]: With dead ends: 237576 [2019-10-03 02:31:18,616 INFO L226 Difference]: Without dead ends: 237576 [2019-10-03 02:31:18,616 INFO L640 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-10-03 02:31:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2019-10-03 02:31:22,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2019-10-03 02:31:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2019-10-03 02:31:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2019-10-03 02:31:23,179 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2019-10-03 02:31:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:23,179 INFO L475 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2019-10-03 02:31:23,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:23,179 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2019-10-03 02:31:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 02:31:23,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:31:23,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:31:23,326 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:31:23,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:31:23,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2019-10-03 02:31:23,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:31:23,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:23,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:31:23,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:31:23,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:31:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:31:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:31:23,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:31:23,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:31:23,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:31:23,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:31:23,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:31:23,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:31:23,351 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2019-10-03 02:31:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:31:23,912 INFO L93 Difference]: Finished difference Result 286726 states and 307205 transitions. [2019-10-03 02:31:23,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:31:23,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-03 02:31:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:31:23,912 INFO L225 Difference]: With dead ends: 286726 [2019-10-03 02:31:23,913 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:31:23,913 INFO L640 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-10-03 02:31:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:31:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:31:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:31:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:31:23,914 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-10-03 02:31:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:31:23,914 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:31:23,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:31:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:31:23,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:31:23,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:31:23 BoogieIcfgContainer [2019-10-03 02:31:23,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:31:23,922 INFO L168 Benchmark]: Toolchain (without parser) took 30736.15 ms. Allocated memory was 131.6 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 87.1 MB in the beginning and 955.5 MB in the end (delta: -868.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-03 02:31:23,922 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 131.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-10-03 02:31:23,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.80 ms. Allocated memory was 131.6 MB in the beginning and 198.7 MB in the end (delta: 67.1 MB). Free memory was 86.9 MB in the beginning and 175.0 MB in the end (delta: -88.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:23,924 INFO L168 Benchmark]: Boogie Preprocessor took 50.65 ms. Allocated memory is still 198.7 MB. Free memory was 175.0 MB in the beginning and 172.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:23,925 INFO L168 Benchmark]: RCFGBuilder took 418.02 ms. Allocated memory is still 198.7 MB. Free memory was 172.6 MB in the beginning and 151.0 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:31:23,926 INFO L168 Benchmark]: TraceAbstraction took 29852.81 ms. Allocated memory was 198.7 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 151.0 MB in the beginning and 955.5 MB in the end (delta: -804.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-03 02:31:23,929 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 131.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 409.80 ms. Allocated memory was 131.6 MB in the beginning and 198.7 MB in the end (delta: 67.1 MB). Free memory was 86.9 MB in the beginning and 175.0 MB in the end (delta: -88.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.65 ms. Allocated memory is still 198.7 MB. Free memory was 175.0 MB in the beginning and 172.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 418.02 ms. Allocated memory is still 198.7 MB. Free memory was 172.6 MB in the beginning and 151.0 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29852.81 ms. Allocated memory was 198.7 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 151.0 MB in the beginning and 955.5 MB in the end (delta: -804.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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, 53 locations, 1 error locations. SAFE Result, 29.7s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4001 SDtfs, 1984 SDslu, 2752 SDs, 0 SdLazy, 197 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229384occurred in iteration=36, 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: 18.5s AutomataMinimizationTime, 37 MinimizatonAttempts, 32808 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 61562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...