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-fea9116 [2019-09-20 13:26:48,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:48,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:48,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:48,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:48,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:48,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:48,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:48,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:48,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:48,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:48,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:48,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:48,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:48,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:48,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:48,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:48,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:48,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:48,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:48,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:48,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:48,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:48,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:48,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:48,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:48,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:48,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:48,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:48,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:48,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:48,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:48,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:48,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:48,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:48,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:48,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:48,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:48,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:48,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:48,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:48,062 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:26:48,077 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:48,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:48,077 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:48,078 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:48,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:48,078 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:48,079 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:48,079 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:48,079 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:48,079 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:48,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:48,080 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:48,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:48,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:48,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:48,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:48,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:48,081 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:48,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:48,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:48,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:48,082 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:48,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:48,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:48,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:48,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:48,083 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:48,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:48,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:48,084 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:48,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:48,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:48,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:48,127 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:48,128 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:48,129 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-09-20 13:26:48,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d41b372/5b93b02498ac4101aaccb7783974f486/FLAGf4c477e52 [2019-09-20 13:26:48,601 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:48,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-09-20 13:26:48,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d41b372/5b93b02498ac4101aaccb7783974f486/FLAGf4c477e52 [2019-09-20 13:26:49,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d41b372/5b93b02498ac4101aaccb7783974f486 [2019-09-20 13:26:49,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:49,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:49,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:49,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:49,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:49,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:49" (1/1) ... [2019-09-20 13:26:49,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c806856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:49, skipping insertion in model container [2019-09-20 13:26:49,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:49" (1/1) ... [2019-09-20 13:26:49,038 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:49,065 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:49,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:49,301 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:49,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:49,440 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:49,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:49 WrapperNode [2019-09-20 13:26:49,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:49,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:49,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:49,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:49,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:49" (1/1) ... [2019-09-20 13:26:49,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:49" (1/1) ... [2019-09-20 13:26:49,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:49" (1/1) ... [2019-09-20 13:26:49,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:49" (1/1) ... [2019-09-20 13:26:49,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:49" (1/1) ... [2019-09-20 13:26:49,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:49" (1/1) ... [2019-09-20 13:26:49,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:49" (1/1) ... [2019-09-20 13:26:49,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:49,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:49,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:49,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:49,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:49,930 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:49,930 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:49,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:49 BoogieIcfgContainer [2019-09-20 13:26:49,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:49,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:49,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:49,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:49,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:49" (1/3) ... [2019-09-20 13:26:49,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc4ea9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:49, skipping insertion in model container [2019-09-20 13:26:49,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:49" (2/3) ... [2019-09-20 13:26:49,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc4ea9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:49, skipping insertion in model container [2019-09-20 13:26:49,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:49" (3/3) ... [2019-09-20 13:26:49,940 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-09-20 13:26:49,949 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:49,956 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:49,972 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:49,998 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:49,998 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:49,998 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:49,999 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:49,999 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:49,999 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:49,999 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:49,999 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-09-20 13:26:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:50,021 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,022 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,025 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2019-09-20 13:26:50,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,255 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-09-20 13:26:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,303 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2019-09-20 13:26:50,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,316 INFO L225 Difference]: With dead ends: 98 [2019-09-20 13:26:50,317 INFO L226 Difference]: Without dead ends: 90 [2019-09-20 13:26:50,318 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-20 13:26:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2019-09-20 13:26:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-20 13:26:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2019-09-20 13:26:50,361 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2019-09-20 13:26:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,362 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2019-09-20 13:26:50,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2019-09-20 13:26:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:50,363 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,364 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,364 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2019-09-20 13:26:50,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,441 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2019-09-20 13:26:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,477 INFO L93 Difference]: Finished difference Result 90 states and 162 transitions. [2019-09-20 13:26:50,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,479 INFO L225 Difference]: With dead ends: 90 [2019-09-20 13:26:50,480 INFO L226 Difference]: Without dead ends: 90 [2019-09-20 13:26:50,481 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-20 13:26:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-20 13:26:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-20 13:26:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2019-09-20 13:26:50,502 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2019-09-20 13:26:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,502 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2019-09-20 13:26:50,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2019-09-20 13:26:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:50,504 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,504 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,504 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,505 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2019-09-20 13:26:50,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,581 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2019-09-20 13:26:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,613 INFO L93 Difference]: Finished difference Result 93 states and 164 transitions. [2019-09-20 13:26:50,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:50,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,615 INFO L225 Difference]: With dead ends: 93 [2019-09-20 13:26:50,616 INFO L226 Difference]: Without dead ends: 93 [2019-09-20 13:26:50,616 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-20 13:26:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-09-20 13:26:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-20 13:26:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2019-09-20 13:26:50,635 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2019-09-20 13:26:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,636 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2019-09-20 13:26:50,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2019-09-20 13:26:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:50,640 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,640 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,641 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2019-09-20 13:26:50,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,692 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2019-09-20 13:26:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,726 INFO L93 Difference]: Finished difference Result 170 states and 309 transitions. [2019-09-20 13:26:50,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,733 INFO L225 Difference]: With dead ends: 170 [2019-09-20 13:26:50,733 INFO L226 Difference]: Without dead ends: 170 [2019-09-20 13:26:50,733 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-20 13:26:50,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2019-09-20 13:26:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-20 13:26:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2019-09-20 13:26:50,750 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2019-09-20 13:26:50,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,750 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2019-09-20 13:26:50,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2019-09-20 13:26:50,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:50,752 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,752 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,753 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2019-09-20 13:26:50,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,809 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2019-09-20 13:26:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,840 INFO L93 Difference]: Finished difference Result 172 states and 307 transitions. [2019-09-20 13:26:50,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,843 INFO L225 Difference]: With dead ends: 172 [2019-09-20 13:26:50,843 INFO L226 Difference]: Without dead ends: 172 [2019-09-20 13:26:50,844 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-20 13:26:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-09-20 13:26:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-20 13:26:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2019-09-20 13:26:50,863 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2019-09-20 13:26:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,864 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2019-09-20 13:26:50,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2019-09-20 13:26:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:50,865 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,866 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,866 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,866 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2019-09-20 13:26:50,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,947 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2019-09-20 13:26:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,962 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2019-09-20 13:26:50,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:50,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,964 INFO L225 Difference]: With dead ends: 174 [2019-09-20 13:26:50,964 INFO L226 Difference]: Without dead ends: 174 [2019-09-20 13:26:50,965 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-20 13:26:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-09-20 13:26:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:26:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2019-09-20 13:26:50,973 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2019-09-20 13:26:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,973 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2019-09-20 13:26:50,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2019-09-20 13:26:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:50,975 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,975 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,976 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2019-09-20 13:26:50,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,023 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2019-09-20 13:26:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,054 INFO L93 Difference]: Finished difference Result 322 states and 579 transitions. [2019-09-20 13:26:51,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,057 INFO L225 Difference]: With dead ends: 322 [2019-09-20 13:26:51,058 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:26:51,058 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:26:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2019-09-20 13:26:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-20 13:26:51,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-09-20 13:26:51,075 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2019-09-20 13:26:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,077 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-09-20 13:26:51,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-09-20 13:26:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:51,087 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,087 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,087 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2019-09-20 13:26:51,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,153 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2019-09-20 13:26:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,188 INFO L93 Difference]: Finished difference Result 330 states and 579 transitions. [2019-09-20 13:26:51,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:51,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,193 INFO L225 Difference]: With dead ends: 330 [2019-09-20 13:26:51,193 INFO L226 Difference]: Without dead ends: 330 [2019-09-20 13:26:51,194 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-20 13:26:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-09-20 13:26:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-20 13:26:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2019-09-20 13:26:51,203 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2019-09-20 13:26:51,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,204 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2019-09-20 13:26:51,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2019-09-20 13:26:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:51,206 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,206 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,206 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2019-09-20 13:26:51,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,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-09-20 13:26:51,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,267 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2019-09-20 13:26:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,283 INFO L93 Difference]: Finished difference Result 334 states and 579 transitions. [2019-09-20 13:26:51,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,287 INFO L225 Difference]: With dead ends: 334 [2019-09-20 13:26:51,287 INFO L226 Difference]: Without dead ends: 334 [2019-09-20 13:26:51,288 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-20 13:26:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-09-20 13:26:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-20 13:26:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2019-09-20 13:26:51,298 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2019-09-20 13:26:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,298 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2019-09-20 13:26:51,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2019-09-20 13:26:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:51,300 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,300 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,300 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,300 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2019-09-20 13:26:51,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,336 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2019-09-20 13:26:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,354 INFO L93 Difference]: Finished difference Result 618 states and 1087 transitions. [2019-09-20 13:26:51,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,358 INFO L225 Difference]: With dead ends: 618 [2019-09-20 13:26:51,358 INFO L226 Difference]: Without dead ends: 618 [2019-09-20 13:26:51,359 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-20 13:26:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2019-09-20 13:26:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-20 13:26:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2019-09-20 13:26:51,371 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2019-09-20 13:26:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,372 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2019-09-20 13:26:51,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2019-09-20 13:26:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:51,373 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,374 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,374 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2019-09-20 13:26:51,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,400 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2019-09-20 13:26:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,420 INFO L93 Difference]: Finished difference Result 642 states and 1095 transitions. [2019-09-20 13:26:51,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:51,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,424 INFO L225 Difference]: With dead ends: 642 [2019-09-20 13:26:51,424 INFO L226 Difference]: Without dead ends: 642 [2019-09-20 13:26:51,424 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-20 13:26:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-09-20 13:26:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-20 13:26:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2019-09-20 13:26:51,440 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2019-09-20 13:26:51,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,441 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2019-09-20 13:26:51,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2019-09-20 13:26:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:51,442 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,442 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,443 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,443 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2019-09-20 13:26:51,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,469 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2019-09-20 13:26:51,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,489 INFO L93 Difference]: Finished difference Result 650 states and 1095 transitions. [2019-09-20 13:26:51,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,494 INFO L225 Difference]: With dead ends: 650 [2019-09-20 13:26:51,494 INFO L226 Difference]: Without dead ends: 650 [2019-09-20 13:26:51,494 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-20 13:26:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-09-20 13:26:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-20 13:26:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2019-09-20 13:26:51,513 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2019-09-20 13:26:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,513 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2019-09-20 13:26:51,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2019-09-20 13:26:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:51,515 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,515 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,515 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2019-09-20 13:26:51,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,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-09-20 13:26:51,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,538 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2019-09-20 13:26:51,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,555 INFO L93 Difference]: Finished difference Result 1194 states and 2039 transitions. [2019-09-20 13:26:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,562 INFO L225 Difference]: With dead ends: 1194 [2019-09-20 13:26:51,562 INFO L226 Difference]: Without dead ends: 1194 [2019-09-20 13:26:51,562 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-09-20 13:26:51,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2019-09-20 13:26:51,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-20 13:26:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2019-09-20 13:26:51,583 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2019-09-20 13:26:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,584 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2019-09-20 13:26:51,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2019-09-20 13:26:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:51,586 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,586 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,586 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,587 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2019-09-20 13:26:51,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,609 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2019-09-20 13:26:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,627 INFO L93 Difference]: Finished difference Result 1258 states and 2071 transitions. [2019-09-20 13:26:51,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,633 INFO L225 Difference]: With dead ends: 1258 [2019-09-20 13:26:51,634 INFO L226 Difference]: Without dead ends: 1258 [2019-09-20 13:26:51,634 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-20 13:26:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-09-20 13:26:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-20 13:26:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2019-09-20 13:26:51,663 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2019-09-20 13:26:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,663 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2019-09-20 13:26:51,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2019-09-20 13:26:51,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:51,665 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,665 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,666 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,666 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2019-09-20 13:26:51,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,697 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2019-09-20 13:26:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,720 INFO L93 Difference]: Finished difference Result 1274 states and 2071 transitions. [2019-09-20 13:26:51,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,727 INFO L225 Difference]: With dead ends: 1274 [2019-09-20 13:26:51,727 INFO L226 Difference]: Without dead ends: 1274 [2019-09-20 13:26:51,727 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-20 13:26:51,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-09-20 13:26:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-20 13:26:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2019-09-20 13:26:51,757 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2019-09-20 13:26:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,757 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2019-09-20 13:26:51,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2019-09-20 13:26:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:51,760 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,760 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,760 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2019-09-20 13:26:51,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,786 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2019-09-20 13:26:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,814 INFO L93 Difference]: Finished difference Result 2314 states and 3815 transitions. [2019-09-20 13:26:51,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,825 INFO L225 Difference]: With dead ends: 2314 [2019-09-20 13:26:51,825 INFO L226 Difference]: Without dead ends: 2314 [2019-09-20 13:26:51,826 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-09-20 13:26:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2019-09-20 13:26:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-09-20 13:26:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2019-09-20 13:26:51,880 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2019-09-20 13:26:51,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,880 INFO L475 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2019-09-20 13:26:51,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2019-09-20 13:26:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:51,883 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,883 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,884 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2019-09-20 13:26:51,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:51,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:51,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:51,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,905 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2019-09-20 13:26:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,932 INFO L93 Difference]: Finished difference Result 2474 states and 3911 transitions. [2019-09-20 13:26:51,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:51,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,944 INFO L225 Difference]: With dead ends: 2474 [2019-09-20 13:26:51,944 INFO L226 Difference]: Without dead ends: 2474 [2019-09-20 13:26:51,944 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-09-20 13:26:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2019-09-20 13:26:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-20 13:26:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2019-09-20 13:26:51,994 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2019-09-20 13:26:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,995 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2019-09-20 13:26:51,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2019-09-20 13:26:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:51,998 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,998 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:51,998 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2019-09-20 13:26:51,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,019 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2019-09-20 13:26:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,044 INFO L93 Difference]: Finished difference Result 2506 states and 3911 transitions. [2019-09-20 13:26:52,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:52,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,058 INFO L225 Difference]: With dead ends: 2506 [2019-09-20 13:26:52,059 INFO L226 Difference]: Without dead ends: 2506 [2019-09-20 13:26:52,059 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-09-20 13:26:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-09-20 13:26:52,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-09-20 13:26:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2019-09-20 13:26:52,134 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2019-09-20 13:26:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,134 INFO L475 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2019-09-20 13:26:52,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2019-09-20 13:26:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:52,138 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,138 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:52,138 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,139 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2019-09-20 13:26:52,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,174 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2019-09-20 13:26:52,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,227 INFO L93 Difference]: Finished difference Result 4490 states and 7111 transitions. [2019-09-20 13:26:52,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,255 INFO L225 Difference]: With dead ends: 4490 [2019-09-20 13:26:52,256 INFO L226 Difference]: Without dead ends: 4490 [2019-09-20 13:26:52,256 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-09-20 13:26:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2019-09-20 13:26:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-09-20 13:26:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2019-09-20 13:26:52,370 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2019-09-20 13:26:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,371 INFO L475 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2019-09-20 13:26:52,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2019-09-20 13:26:52,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:52,379 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,379 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:52,380 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,380 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2019-09-20 13:26:52,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,403 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2019-09-20 13:26:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,451 INFO L93 Difference]: Finished difference Result 4874 states and 7367 transitions. [2019-09-20 13:26:52,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,479 INFO L225 Difference]: With dead ends: 4874 [2019-09-20 13:26:52,479 INFO L226 Difference]: Without dead ends: 4874 [2019-09-20 13:26:52,479 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-09-20 13:26:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2019-09-20 13:26:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2019-09-20 13:26:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2019-09-20 13:26:52,601 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2019-09-20 13:26:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,601 INFO L475 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2019-09-20 13:26:52,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2019-09-20 13:26:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:52,608 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,609 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:52,609 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,609 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2019-09-20 13:26:52,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,635 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2019-09-20 13:26:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,691 INFO L93 Difference]: Finished difference Result 4938 states and 7367 transitions. [2019-09-20 13:26:52,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:52,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,716 INFO L225 Difference]: With dead ends: 4938 [2019-09-20 13:26:52,717 INFO L226 Difference]: Without dead ends: 4938 [2019-09-20 13:26:52,717 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2019-09-20 13:26:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2019-09-20 13:26:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2019-09-20 13:26:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2019-09-20 13:26:52,811 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2019-09-20 13:26:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,812 INFO L475 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2019-09-20 13:26:52,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2019-09-20 13:26:52,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:52,818 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,818 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:52,818 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2019-09-20 13:26:52,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,843 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2019-09-20 13:26:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,896 INFO L93 Difference]: Finished difference Result 9610 states and 13959 transitions. [2019-09-20 13:26:52,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,924 INFO L225 Difference]: With dead ends: 9610 [2019-09-20 13:26:52,925 INFO L226 Difference]: Without dead ends: 9610 [2019-09-20 13:26:52,925 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2019-09-20 13:26:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2019-09-20 13:26:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-09-20 13:26:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2019-09-20 13:26:53,107 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2019-09-20 13:26:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,107 INFO L475 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2019-09-20 13:26:53,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2019-09-20 13:26:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:26:53,118 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,118 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:53,118 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2019-09-20 13:26:53,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:53,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,147 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2019-09-20 13:26:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,197 INFO L93 Difference]: Finished difference Result 11146 states and 16647 transitions. [2019-09-20 13:26:53,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:26:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,221 INFO L225 Difference]: With dead ends: 11146 [2019-09-20 13:26:53,221 INFO L226 Difference]: Without dead ends: 11146 [2019-09-20 13:26:53,222 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-09-20 13:26:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2019-09-20 13:26:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-09-20 13:26:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2019-09-20 13:26:53,454 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2019-09-20 13:26:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,455 INFO L475 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2019-09-20 13:26:53,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2019-09-20 13:26:53,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:53,469 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,470 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:53,470 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,471 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2019-09-20 13:26:53,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:53,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,508 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2019-09-20 13:26:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,576 INFO L93 Difference]: Finished difference Result 16778 states and 24455 transitions. [2019-09-20 13:26:53,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,609 INFO L225 Difference]: With dead ends: 16778 [2019-09-20 13:26:53,609 INFO L226 Difference]: Without dead ends: 16778 [2019-09-20 13:26:53,612 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2019-09-20 13:26:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2019-09-20 13:26:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-09-20 13:26:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2019-09-20 13:26:53,833 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2019-09-20 13:26:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,834 INFO L475 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2019-09-20 13:26:53,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2019-09-20 13:26:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:53,859 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,859 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:53,860 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2019-09-20 13:26:53,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:53,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,883 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2019-09-20 13:26:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,957 INFO L93 Difference]: Finished difference Result 18826 states and 26119 transitions. [2019-09-20 13:26:53,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:53,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:53,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,995 INFO L225 Difference]: With dead ends: 18826 [2019-09-20 13:26:53,995 INFO L226 Difference]: Without dead ends: 18826 [2019-09-20 13:26:53,996 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2019-09-20 13:26:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2019-09-20 13:26:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2019-09-20 13:26:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2019-09-20 13:26:54,338 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2019-09-20 13:26:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,339 INFO L475 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2019-09-20 13:26:54,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2019-09-20 13:26:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:26:54,361 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,361 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,361 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,362 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2019-09-20 13:26:54,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:54,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,383 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2019-09-20 13:26:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,444 INFO L93 Difference]: Finished difference Result 19210 states and 26375 transitions. [2019-09-20 13:26:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:26:54,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,478 INFO L225 Difference]: With dead ends: 19210 [2019-09-20 13:26:54,478 INFO L226 Difference]: Without dead ends: 19210 [2019-09-20 13:26:54,479 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2019-09-20 13:26:54,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2019-09-20 13:26:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2019-09-20 13:26:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2019-09-20 13:26:55,348 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2019-09-20 13:26:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,349 INFO L475 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2019-09-20 13:26:55,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2019-09-20 13:26:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:26:55,369 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,369 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,369 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2019-09-20 13:26:55,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:55,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:55,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:55,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,394 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2019-09-20 13:26:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,473 INFO L93 Difference]: Finished difference Result 32778 states and 45319 transitions. [2019-09-20 13:26:55,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:55,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:26:55,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,533 INFO L225 Difference]: With dead ends: 32778 [2019-09-20 13:26:55,533 INFO L226 Difference]: Without dead ends: 32778 [2019-09-20 13:26:55,534 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:55,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2019-09-20 13:26:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2019-09-20 13:26:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2019-09-20 13:26:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2019-09-20 13:26:55,967 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2019-09-20 13:26:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,967 INFO L475 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2019-09-20 13:26:55,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2019-09-20 13:26:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:26:56,007 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:56,007 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:56,008 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:56,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2019-09-20 13:26:56,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:56,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:56,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:56,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:56,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:56,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:56,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,030 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2019-09-20 13:26:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:56,113 INFO L93 Difference]: Finished difference Result 37386 states and 49159 transitions. [2019-09-20 13:26:56,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:56,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:26:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,184 INFO L225 Difference]: With dead ends: 37386 [2019-09-20 13:26:56,185 INFO L226 Difference]: Without dead ends: 37386 [2019-09-20 13:26:56,185 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2019-09-20 13:26:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2019-09-20 13:26:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2019-09-20 13:26:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2019-09-20 13:26:56,714 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2019-09-20 13:26:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:56,714 INFO L475 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2019-09-20 13:26:56,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2019-09-20 13:26:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:26:56,747 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:56,747 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:56,747 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:56,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2019-09-20 13:26:56,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:56,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:56,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:56,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:56,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:56,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:56,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,771 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2019-09-20 13:26:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:56,859 INFO L93 Difference]: Finished difference Result 37898 states and 49159 transitions. [2019-09-20 13:26:56,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:56,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:26:56,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,922 INFO L225 Difference]: With dead ends: 37898 [2019-09-20 13:26:56,922 INFO L226 Difference]: Without dead ends: 37898 [2019-09-20 13:26:56,922 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:56,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2019-09-20 13:26:57,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2019-09-20 13:26:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2019-09-20 13:26:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2019-09-20 13:26:57,478 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2019-09-20 13:26:57,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:57,479 INFO L475 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2019-09-20 13:26:57,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2019-09-20 13:26:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:26:57,498 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:57,498 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:57,499 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:57,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:57,499 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2019-09-20 13:26:57,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:57,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:57,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:57,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:57,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:57,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:57,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:57,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:57,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:57,523 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2019-09-20 13:26:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:57,646 INFO L93 Difference]: Finished difference Result 63498 states and 82439 transitions. [2019-09-20 13:26:57,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:57,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:26:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:57,713 INFO L225 Difference]: With dead ends: 63498 [2019-09-20 13:26:57,714 INFO L226 Difference]: Without dead ends: 63498 [2019-09-20 13:26:57,715 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2019-09-20 13:26:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2019-09-20 13:26:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2019-09-20 13:26:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2019-09-20 13:26:58,453 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2019-09-20 13:26:58,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,454 INFO L475 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2019-09-20 13:26:58,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:58,454 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2019-09-20 13:26:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:26:58,485 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,485 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:58,485 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2019-09-20 13:26:58,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:58,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:58,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:58,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:58,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,515 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2019-09-20 13:26:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,668 INFO L93 Difference]: Finished difference Result 73738 states and 91143 transitions. [2019-09-20 13:26:58,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:58,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:26:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,722 INFO L225 Difference]: With dead ends: 73738 [2019-09-20 13:26:58,722 INFO L226 Difference]: Without dead ends: 73738 [2019-09-20 13:26:58,722 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2019-09-20 13:27:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2019-09-20 13:27:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2019-09-20 13:27:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2019-09-20 13:27:00,347 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2019-09-20 13:27:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:00,348 INFO L475 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2019-09-20 13:27:00,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2019-09-20 13:27:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:27:00,373 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:00,373 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:00,373 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:00,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:00,373 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2019-09-20 13:27:00,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:00,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:00,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:00,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:00,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:00,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:00,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:00,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,399 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2019-09-20 13:27:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:00,591 INFO L93 Difference]: Finished difference Result 74762 states and 91143 transitions. [2019-09-20 13:27:00,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:00,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:27:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:00,673 INFO L225 Difference]: With dead ends: 74762 [2019-09-20 13:27:00,674 INFO L226 Difference]: Without dead ends: 74762 [2019-09-20 13:27:00,675 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2019-09-20 13:27:01,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2019-09-20 13:27:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2019-09-20 13:27:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2019-09-20 13:27:01,575 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2019-09-20 13:27:01,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:01,576 INFO L475 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2019-09-20 13:27:01,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2019-09-20 13:27:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:27:01,599 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:01,599 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:01,599 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:01,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:01,599 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2019-09-20 13:27:01,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:01,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:01,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:01,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:01,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:01,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:01,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:01,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:01,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:01,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:01,626 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2019-09-20 13:27:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:01,845 INFO L93 Difference]: Finished difference Result 122890 states and 148487 transitions. [2019-09-20 13:27:01,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:01,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:27:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:01,947 INFO L225 Difference]: With dead ends: 122890 [2019-09-20 13:27:01,947 INFO L226 Difference]: Without dead ends: 122890 [2019-09-20 13:27:01,947 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2019-09-20 13:27:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2019-09-20 13:27:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2019-09-20 13:27:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2019-09-20 13:27:04,236 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2019-09-20 13:27:04,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:04,236 INFO L475 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2019-09-20 13:27:04,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2019-09-20 13:27:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:27:04,286 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:04,286 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:04,287 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:04,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:04,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2019-09-20 13:27:04,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:04,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:04,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:04,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:04,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:04,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:04,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:04,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:04,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:04,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:04,307 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2019-09-20 13:27:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:04,917 INFO L93 Difference]: Finished difference Result 145418 states and 167943 transitions. [2019-09-20 13:27:04,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:04,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:27:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:05,023 INFO L225 Difference]: With dead ends: 145418 [2019-09-20 13:27:05,023 INFO L226 Difference]: Without dead ends: 145418 [2019-09-20 13:27:05,023 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2019-09-20 13:27:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2019-09-20 13:27:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2019-09-20 13:27:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2019-09-20 13:27:08,312 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2019-09-20 13:27:08,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:08,312 INFO L475 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2019-09-20 13:27:08,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2019-09-20 13:27:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:27:08,368 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:08,368 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:08,368 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:08,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:08,368 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2019-09-20 13:27:08,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:08,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:08,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:08,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:08,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:08,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:08,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:08,406 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2019-09-20 13:27:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,751 INFO L93 Difference]: Finished difference Result 147466 states and 167943 transitions. [2019-09-20 13:27:08,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:08,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-20 13:27:08,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,921 INFO L225 Difference]: With dead ends: 147466 [2019-09-20 13:27:08,921 INFO L226 Difference]: Without dead ends: 147466 [2019-09-20 13:27:08,922 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2019-09-20 13:27:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2019-09-20 13:27:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2019-09-20 13:27:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2019-09-20 13:27:10,544 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2019-09-20 13:27:10,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:10,544 INFO L475 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2019-09-20 13:27:10,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2019-09-20 13:27:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:27:10,594 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:10,594 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:10,595 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:10,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:10,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2019-09-20 13:27:10,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:10,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:10,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:10,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:10,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:10,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:10,613 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:10,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:10,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:10,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:10,614 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2019-09-20 13:27:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:10,965 INFO L93 Difference]: Finished difference Result 237576 states and 264198 transitions. [2019-09-20 13:27:10,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:10,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-20 13:27:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,193 INFO L225 Difference]: With dead ends: 237576 [2019-09-20 13:27:11,193 INFO L226 Difference]: Without dead ends: 237576 [2019-09-20 13:27:11,193 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2019-09-20 13:27:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2019-09-20 13:27:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2019-09-20 13:27:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2019-09-20 13:27:16,284 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2019-09-20 13:27:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,285 INFO L475 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2019-09-20 13:27:16,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2019-09-20 13:27:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:27:16,411 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:16,411 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:16,412 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:16,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:16,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2019-09-20 13:27:16,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:16,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:16,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:16,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:16,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:16,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:16,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:16,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:16,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:16,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:16,435 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2019-09-20 13:27:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:16,911 INFO L93 Difference]: Finished difference Result 286726 states and 307205 transitions. [2019-09-20 13:27:16,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:16,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-20 13:27:16,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:16,911 INFO L225 Difference]: With dead ends: 286726 [2019-09-20 13:27:16,911 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:27:16,912 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:27:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:27:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:27:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:27:16,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-09-20 13:27:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:16,917 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:27:16,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:27:16,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:27:16,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:16 BoogieIcfgContainer [2019-09-20 13:27:16,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:16,927 INFO L168 Benchmark]: Toolchain (without parser) took 27904.39 ms. Allocated memory was 136.3 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 83.0 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-20 13:27:16,928 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.3 MB. Free memory was 102.2 MB in the beginning and 102.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:27:16,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.34 ms. Allocated memory was 136.3 MB in the beginning and 196.1 MB in the end (delta: 59.8 MB). Free memory was 82.8 MB in the beginning and 173.2 MB in the end (delta: -90.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:16,929 INFO L168 Benchmark]: Boogie Preprocessor took 39.01 ms. Allocated memory is still 196.1 MB. Free memory was 173.2 MB in the beginning and 171.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:16,932 INFO L168 Benchmark]: RCFGBuilder took 451.38 ms. Allocated memory is still 196.1 MB. Free memory was 171.3 MB in the beginning and 149.2 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:16,932 INFO L168 Benchmark]: TraceAbstraction took 26990.94 ms. Allocated memory was 196.1 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 148.5 MB in the beginning and 1.1 GB in the end (delta: -974.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-09-20 13:27:16,942 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 136.3 MB. Free memory was 102.2 MB in the beginning and 102.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 418.34 ms. Allocated memory was 136.3 MB in the beginning and 196.1 MB in the end (delta: 59.8 MB). Free memory was 82.8 MB in the beginning and 173.2 MB in the end (delta: -90.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.01 ms. Allocated memory is still 196.1 MB. Free memory was 173.2 MB in the beginning and 171.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 451.38 ms. Allocated memory is still 196.1 MB. Free memory was 171.3 MB in the beginning and 149.2 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26990.94 ms. Allocated memory was 196.1 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 148.5 MB in the beginning and 1.1 GB in the end (delta: -974.2 MB). Peak memory consumption was 1.2 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, 26.9s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 5.0s 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.3s 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: 19.7s AutomataMinimizationTime, 37 MinimizatonAttempts, 32808 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s 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...