java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:49:38,036 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:49:38,038 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:49:38,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:49:38,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:49:38,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:49:38,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:49:38,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:49:38,061 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:49:38,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:49:38,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:49:38,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:49:38,064 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:49:38,065 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:49:38,066 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:49:38,068 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:49:38,070 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:49:38,072 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:49:38,074 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:49:38,075 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:49:38,077 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:49:38,077 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:49:38,077 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:49:38,078 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:49:38,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:49:38,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:49:38,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:49:38,082 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:49:38,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:49:38,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:49:38,083 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:49:38,083 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:49:38,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:49:38,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:49:38,093 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:49:38,093 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:49:38,094 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:49:38,094 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:49:38,094 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:49:38,094 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:49:38,094 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:49:38,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:49:38,095 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:49:38,095 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:49:38,096 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:49:38,096 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:49:38,096 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:49:38,096 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:49:38,096 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:49:38,096 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:49:38,097 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:49:38,097 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:49:38,097 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:49:38,097 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:49:38,097 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:49:38,097 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:49:38,098 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:49:38,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:49:38,098 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:49:38,098 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:49:38,098 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:49:38,098 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:49:38,099 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:49:38,099 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:49:38,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:49:38,099 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:49:38,099 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:49:38,100 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:49:38,100 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:49:38,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:49:38,149 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:49:38,153 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:49:38,155 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:49:38,155 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:49:38,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:49:38,331 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:49:38,337 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:49:38,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:49:38,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:49:38,343 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:49:38,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:49:38" (1/1) ... [2018-01-25 02:49:38,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38c37626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:49:38, skipping insertion in model container [2018-01-25 02:49:38,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:49:38" (1/1) ... [2018-01-25 02:49:38,364 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:49:38,406 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:49:38,556 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:49:38,577 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:49:38,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:49:38 WrapperNode [2018-01-25 02:49:38,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:49:38,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:49:38,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:49:38,585 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:49:38,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:49:38" (1/1) ... [2018-01-25 02:49:38,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:49:38" (1/1) ... [2018-01-25 02:49:38,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:49:38" (1/1) ... [2018-01-25 02:49:38,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:49:38" (1/1) ... [2018-01-25 02:49:38,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:49:38" (1/1) ... [2018-01-25 02:49:38,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:49:38" (1/1) ... [2018-01-25 02:49:38,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:49:38" (1/1) ... [2018-01-25 02:49:38,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:49:38,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:49:38,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:49:38,626 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:49:38,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:49:38" (1/1) ... No working directory specified, using /storage/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 [2018-01-25 02:49:38,688 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:49:38,688 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:49:38,688 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-01-25 02:49:38,688 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:49:38,688 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:49:38,688 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:49:38,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:49:38,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:49:38,689 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:49:38,689 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:49:38,689 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-01-25 02:49:38,689 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:49:38,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:49:38,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:49:38,997 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:49:38,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:49:38 BoogieIcfgContainer [2018-01-25 02:49:38,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:49:38,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:49:38,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:49:39,000 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:49:39,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:49:38" (1/3) ... [2018-01-25 02:49:39,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb038e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:49:39, skipping insertion in model container [2018-01-25 02:49:39,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:49:38" (2/3) ... [2018-01-25 02:49:39,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb038e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:49:39, skipping insertion in model container [2018-01-25 02:49:39,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:49:38" (3/3) ... [2018-01-25 02:49:39,003 INFO L105 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:49:39,010 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:49:39,016 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 02:49:39,065 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:49:39,065 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:49:39,066 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:49:39,066 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:49:39,066 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:49:39,066 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:49:39,066 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:49:39,066 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:49:39,067 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:49:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-25 02:49:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:49:39,107 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:39,109 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:49:39,109 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:39,114 INFO L82 PathProgramCache]: Analyzing trace with hash 680757637, now seen corresponding path program 1 times [2018-01-25 02:49:39,117 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:39,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:39,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:39,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:39,178 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:39,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:39,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:39,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:49:39,405 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:39,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:49:39,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:49:39,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:49:39,421 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-01-25 02:49:39,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:39,665 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-01-25 02:49:39,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:49:39,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:49:39,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:39,674 INFO L225 Difference]: With dead ends: 92 [2018-01-25 02:49:39,674 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 02:49:39,678 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:49:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 02:49:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 02:49:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 02:49:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-25 02:49:39,711 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-01-25 02:49:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:39,711 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-25 02:49:39,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:49:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-25 02:49:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:49:39,712 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:39,712 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:49:39,712 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:39,712 INFO L82 PathProgramCache]: Analyzing trace with hash 680757638, now seen corresponding path program 1 times [2018-01-25 02:49:39,712 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:39,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:39,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:39,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:39,714 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:39,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:39,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:39,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:49:39,946 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:39,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:49:39,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:49:39,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:49:39,949 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-01-25 02:49:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:40,039 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-25 02:49:40,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:49:40,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 02:49:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:40,041 INFO L225 Difference]: With dead ends: 52 [2018-01-25 02:49:40,041 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 02:49:40,042 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:49:40,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 02:49:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 02:49:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 02:49:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-25 02:49:40,049 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-01-25 02:49:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:40,050 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-25 02:49:40,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:49:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-25 02:49:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:49:40,050 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:40,051 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:49:40,051 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:40,051 INFO L82 PathProgramCache]: Analyzing trace with hash -371349738, now seen corresponding path program 1 times [2018-01-25 02:49:40,051 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:40,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:40,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:40,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:40,053 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:40,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:40,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:40,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:49:40,105 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:40,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:49:40,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:49:40,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:49:40,106 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-01-25 02:49:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:40,173 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-25 02:49:40,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:49:40,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:49:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:40,175 INFO L225 Difference]: With dead ends: 51 [2018-01-25 02:49:40,175 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 02:49:40,176 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:49:40,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 02:49:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 02:49:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:49:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-25 02:49:40,183 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-01-25 02:49:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:40,183 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-25 02:49:40,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:49:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-25 02:49:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:49:40,184 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:40,184 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:49:40,185 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash -371349737, now seen corresponding path program 1 times [2018-01-25 02:49:40,185 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:40,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:40,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:40,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:40,187 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:40,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:40,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:40,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:49:40,277 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:40,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:49:40,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:49:40,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:49:40,278 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-01-25 02:49:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:40,358 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-25 02:49:40,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:49:40,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:49:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:40,360 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:49:40,360 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:49:40,360 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:49:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:49:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 02:49:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 02:49:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-25 02:49:40,367 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-01-25 02:49:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:40,367 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-25 02:49:40,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:49:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-25 02:49:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:49:40,369 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:40,369 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:49:40,369 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash -435796900, now seen corresponding path program 1 times [2018-01-25 02:49:40,369 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:40,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:40,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:40,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:40,371 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:40,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:40,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:40,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:49:40,415 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:40,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:49:40,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:49:40,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:49:40,416 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-01-25 02:49:40,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:40,480 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-25 02:49:40,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:49:40,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 02:49:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:40,482 INFO L225 Difference]: With dead ends: 49 [2018-01-25 02:49:40,482 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 02:49:40,483 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:49:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 02:49:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 02:49:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 02:49:40,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-25 02:49:40,489 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-01-25 02:49:40,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:40,490 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-25 02:49:40,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:49:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-25 02:49:40,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:49:40,491 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:40,491 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:49:40,491 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:40,491 INFO L82 PathProgramCache]: Analyzing trace with hash -435796899, now seen corresponding path program 1 times [2018-01-25 02:49:40,491 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:40,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:40,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:40,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:40,493 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:40,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:40,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:40,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:49:40,606 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:40,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:49:40,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:49:40,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:49:40,607 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-01-25 02:49:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:40,767 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-25 02:49:40,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:49:40,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-25 02:49:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:40,771 INFO L225 Difference]: With dead ends: 73 [2018-01-25 02:49:40,771 INFO L226 Difference]: Without dead ends: 72 [2018-01-25 02:49:40,772 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:49:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-25 02:49:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-01-25 02:49:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:49:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-25 02:49:40,777 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-01-25 02:49:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:40,777 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-25 02:49:40,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:49:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-25 02:49:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:49:40,778 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:40,778 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:49:40,778 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:40,779 INFO L82 PathProgramCache]: Analyzing trace with hash 860706905, now seen corresponding path program 1 times [2018-01-25 02:49:40,779 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:40,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:40,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:40,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:40,780 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:40,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:40,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:40,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:49:40,838 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:40,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:49:40,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:49:40,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:49:40,839 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-01-25 02:49:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:40,942 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-25 02:49:40,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:49:40,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-25 02:49:40,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:40,943 INFO L225 Difference]: With dead ends: 54 [2018-01-25 02:49:40,944 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 02:49:40,944 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:49:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 02:49:40,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-01-25 02:49:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 02:49:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-25 02:49:40,950 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-01-25 02:49:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:40,951 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-25 02:49:40,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:49:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-25 02:49:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:49:40,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:40,952 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:49:40,952 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:40,952 INFO L82 PathProgramCache]: Analyzing trace with hash 860706906, now seen corresponding path program 1 times [2018-01-25 02:49:40,952 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:40,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:40,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:40,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:40,954 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:40,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:41,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:41,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:49:41,075 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:41,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:49:41,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:49:41,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:49:41,076 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-01-25 02:49:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:41,197 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-25 02:49:41,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:49:41,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-25 02:49:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:41,199 INFO L225 Difference]: With dead ends: 69 [2018-01-25 02:49:41,199 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 02:49:41,199 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:49:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 02:49:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-25 02:49:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 02:49:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-01-25 02:49:41,206 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-01-25 02:49:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:41,206 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-01-25 02:49:41,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:49:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-01-25 02:49:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:49:41,207 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:41,207 INFO L322 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] [2018-01-25 02:49:41,207 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:41,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895137, now seen corresponding path program 1 times [2018-01-25 02:49:41,208 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:41,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:41,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:41,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:41,209 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:41,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:41,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:41,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:49:41,272 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:41,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:49:41,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:49:41,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:49:41,273 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-01-25 02:49:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:41,420 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-01-25 02:49:41,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:49:41,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 02:49:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:41,421 INFO L225 Difference]: With dead ends: 60 [2018-01-25 02:49:41,421 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 02:49:41,421 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:49:41,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 02:49:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-25 02:49:41,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 02:49:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-25 02:49:41,427 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-01-25 02:49:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:41,427 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-25 02:49:41,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:49:41,427 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-25 02:49:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:49:41,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:41,428 INFO L322 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] [2018-01-25 02:49:41,428 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:41,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895136, now seen corresponding path program 1 times [2018-01-25 02:49:41,428 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:41,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:41,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:41,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:41,429 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:41,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:41,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:41,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:49:41,536 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:41,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:49:41,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:49:41,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:49:41,537 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-01-25 02:49:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:41,708 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-01-25 02:49:41,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:49:41,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-25 02:49:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:41,709 INFO L225 Difference]: With dead ends: 93 [2018-01-25 02:49:41,710 INFO L226 Difference]: Without dead ends: 92 [2018-01-25 02:49:41,710 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:49:41,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-25 02:49:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-01-25 02:49:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 02:49:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-01-25 02:49:41,720 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-01-25 02:49:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:41,721 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-01-25 02:49:41,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:49:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-01-25 02:49:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:49:41,722 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:41,722 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:49:41,722 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1731827764, now seen corresponding path program 1 times [2018-01-25 02:49:41,723 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:41,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:41,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:41,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:41,724 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:41,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:41,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:41,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:49:41,776 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:41,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:49:41,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:49:41,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:49:41,777 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-01-25 02:49:41,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:41,796 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2018-01-25 02:49:41,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:49:41,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-25 02:49:41,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:41,797 INFO L225 Difference]: With dead ends: 101 [2018-01-25 02:49:41,797 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 02:49:41,798 INFO L525 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 [2018-01-25 02:49:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 02:49:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-25 02:49:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 02:49:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-01-25 02:49:41,806 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-01-25 02:49:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:41,807 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-01-25 02:49:41,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:49:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-01-25 02:49:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 02:49:41,808 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:41,808 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:49:41,808 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:41,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2135151184, now seen corresponding path program 1 times [2018-01-25 02:49:41,808 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:41,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:41,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:41,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:41,810 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:41,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:42,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:42,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:49:42,043 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:42,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:49:42,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:49:42,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:49:42,044 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-01-25 02:49:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:42,235 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2018-01-25 02:49:42,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:49:42,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-25 02:49:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:42,236 INFO L225 Difference]: With dead ends: 109 [2018-01-25 02:49:42,236 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 02:49:42,236 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:49:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 02:49:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-25 02:49:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 02:49:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-01-25 02:49:42,245 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-01-25 02:49:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:42,245 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-01-25 02:49:42,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:49:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-01-25 02:49:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 02:49:42,247 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:42,247 INFO L322 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] [2018-01-25 02:49:42,247 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:42,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1750130544, now seen corresponding path program 1 times [2018-01-25 02:49:42,247 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:42,248 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:42,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:42,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:42,249 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:42,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:42,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:42,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:49:42,593 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:42,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:49:42,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:49:42,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:49:42,594 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2018-01-25 02:49:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:42,794 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-01-25 02:49:42,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:49:42,794 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-25 02:49:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:42,795 INFO L225 Difference]: With dead ends: 67 [2018-01-25 02:49:42,795 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 02:49:42,795 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:49:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 02:49:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 02:49:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 02:49:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-25 02:49:42,803 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-01-25 02:49:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:42,803 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-25 02:49:42,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:49:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-25 02:49:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 02:49:42,805 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:42,805 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:49:42,805 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 02:49:42,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1520679734, now seen corresponding path program 1 times [2018-01-25 02:49:42,805 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:42,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:42,806 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:42,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:42,807 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:42,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:43,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:49:43,091 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:49:43,092 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 02:49:43,094 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [20], [21], [22], [25], [36], [40], [42], [49], [53], [55], [57], [58], [61], [62], [65], [68], [76], [92], [93], [94], [96] [2018-01-25 02:49:43,160 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:49:43,161 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown