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/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:19:53,025 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:19:53,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:19:53,043 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:19:53,043 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:19:53,044 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:19:53,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:19:53,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:19:53,049 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:19:53,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:19:53,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:19:53,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:19:53,052 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:19:53,054 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:19:53,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:19:53,057 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:19:53,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:19:53,062 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:19:53,063 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:19:53,064 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:19:53,067 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:19:53,067 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:19:53,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:19:53,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:19:53,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:19:53,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:19:53,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:19:53,072 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:19:53,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:19:53,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:19:53,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:19:53,073 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 03:19:53,083 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:19:53,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:19:53,084 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:19:53,084 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:19:53,084 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:19:53,085 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:19:53,085 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:19:53,085 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:19:53,085 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:19:53,086 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:19:53,086 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:19:53,086 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:19:53,087 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:19:53,087 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:19:53,087 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:19:53,087 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:19:53,087 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:19:53,088 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:19:53,088 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:19:53,088 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:19:53,088 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:19:53,088 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:19:53,089 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:19:53,089 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:19:53,089 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:19:53,089 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:19:53,089 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:19:53,090 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:19:53,090 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:19:53,090 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:19:53,090 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:19:53,090 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:19:53,090 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:19:53,091 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:19:53,091 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:19:53,092 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:19:53,092 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:19:53,128 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:19:53,139 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:19:53,143 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:19:53,144 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:19:53,144 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:19:53,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-01-25 03:19:53,342 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:19:53,348 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:19:53,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:19:53,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:19:53,354 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:19:53,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:19:53" (1/1) ... [2018-01-25 03:19:53,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60552eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:53, skipping insertion in model container [2018-01-25 03:19:53,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:19:53" (1/1) ... [2018-01-25 03:19:53,372 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:19:53,413 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:19:53,540 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:19:53,563 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:19:53,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:53 WrapperNode [2018-01-25 03:19:53,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:19:53,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:19:53,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:19:53,574 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:19:53,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:53" (1/1) ... [2018-01-25 03:19:53,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:53" (1/1) ... [2018-01-25 03:19:53,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:53" (1/1) ... [2018-01-25 03:19:53,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:53" (1/1) ... [2018-01-25 03:19:53,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:53" (1/1) ... [2018-01-25 03:19:53,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:53" (1/1) ... [2018-01-25 03:19:53,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:53" (1/1) ... [2018-01-25 03:19:53,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:19:53,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:19:53,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:19:53,614 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:19:53,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:53" (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 03:19:53,665 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:19:53,665 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:19:53,665 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-25 03:19:53,665 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:19:53,666 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:19:53,666 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:19:53,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:19:53,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:19:53,666 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:19:53,666 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:19:53,666 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:19:53,666 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:19:53,666 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-25 03:19:53,667 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:19:53,667 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:19:53,667 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:19:54,070 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:19:54,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:19:54 BoogieIcfgContainer [2018-01-25 03:19:54,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:19:54,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:19:54,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:19:54,077 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:19:54,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:19:53" (1/3) ... [2018-01-25 03:19:54,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd319b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:19:54, skipping insertion in model container [2018-01-25 03:19:54,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:53" (2/3) ... [2018-01-25 03:19:54,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd319b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:19:54, skipping insertion in model container [2018-01-25 03:19:54,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:19:54" (3/3) ... [2018-01-25 03:19:54,083 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-01-25 03:19:54,099 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:19:54,106 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-25 03:19:54,158 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:19:54,159 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:19:54,159 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:19:54,159 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:19:54,159 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:19:54,159 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:19:54,159 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:19:54,160 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:19:54,161 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:19:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2018-01-25 03:19:54,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 03:19:54,186 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:54,187 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:54,187 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2046659462, now seen corresponding path program 1 times [2018-01-25 03:19:54,193 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:54,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:54,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:54,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:54,236 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:54,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:54,335 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 03:19:54,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:54,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:19:54,338 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:54,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:19:54,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:19:54,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:19:54,353 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 3 states. [2018-01-25 03:19:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:54,739 INFO L93 Difference]: Finished difference Result 167 states and 181 transitions. [2018-01-25 03:19:54,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:19:54,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 03:19:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:54,750 INFO L225 Difference]: With dead ends: 167 [2018-01-25 03:19:54,750 INFO L226 Difference]: Without dead ends: 106 [2018-01-25 03:19:54,753 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 03:19:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-25 03:19:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2018-01-25 03:19:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-25 03:19:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-01-25 03:19:54,792 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 7 [2018-01-25 03:19:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:54,792 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-01-25 03:19:54,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:19:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-01-25 03:19:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 03:19:54,793 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:54,793 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:54,793 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2046659463, now seen corresponding path program 1 times [2018-01-25 03:19:54,793 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:54,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:54,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:54,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:54,794 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:54,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:54,861 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 03:19:54,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:54,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:19:54,861 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:54,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:19:54,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:19:54,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:19:54,863 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 3 states. [2018-01-25 03:19:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:55,015 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-01-25 03:19:55,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:19:55,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 03:19:55,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:55,018 INFO L225 Difference]: With dead ends: 103 [2018-01-25 03:19:55,018 INFO L226 Difference]: Without dead ends: 102 [2018-01-25 03:19:55,019 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 03:19:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-25 03:19:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-01-25 03:19:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-25 03:19:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-01-25 03:19:55,028 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 7 [2018-01-25 03:19:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:55,028 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-01-25 03:19:55,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:19:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-01-25 03:19:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:19:55,029 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:55,029 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:55,029 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash -190938367, now seen corresponding path program 1 times [2018-01-25 03:19:55,029 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:55,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:55,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:55,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:55,031 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:55,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:55,135 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 03:19:55,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:55,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:19:55,177 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:55,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:19:55,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:19:55,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:19:55,178 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 5 states. [2018-01-25 03:19:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:55,368 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-01-25 03:19:55,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:19:55,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 03:19:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:55,370 INFO L225 Difference]: With dead ends: 100 [2018-01-25 03:19:55,370 INFO L226 Difference]: Without dead ends: 96 [2018-01-25 03:19:55,370 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 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 03:19:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-25 03:19:55,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-01-25 03:19:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 03:19:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-25 03:19:55,377 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 14 [2018-01-25 03:19:55,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:55,378 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-25 03:19:55,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:19:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-25 03:19:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:19:55,378 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:55,379 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:55,379 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:55,379 INFO L82 PathProgramCache]: Analyzing trace with hash -190938366, now seen corresponding path program 1 times [2018-01-25 03:19:55,379 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:55,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:55,380 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:55,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:55,380 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:55,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:55,520 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 03:19:55,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:55,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:19:55,521 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:55,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:19:55,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:19:55,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:19:55,522 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 7 states. [2018-01-25 03:19:55,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:55,703 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-01-25 03:19:55,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:19:55,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-25 03:19:55,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:55,705 INFO L225 Difference]: With dead ends: 93 [2018-01-25 03:19:55,705 INFO L226 Difference]: Without dead ends: 84 [2018-01-25 03:19:55,705 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:19:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-25 03:19:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-25 03:19:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-25 03:19:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-01-25 03:19:55,711 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 14 [2018-01-25 03:19:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:55,711 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-01-25 03:19:55,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:19:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-01-25 03:19:55,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:19:55,712 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:55,712 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:55,712 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:55,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1624122010, now seen corresponding path program 1 times [2018-01-25 03:19:55,713 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:55,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:55,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:55,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:55,714 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:55,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:55,765 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 03:19:55,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:55,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:19:55,768 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:55,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:19:55,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:19:55,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:19:55,769 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 4 states. [2018-01-25 03:19:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:55,886 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-01-25 03:19:55,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:19:55,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 03:19:55,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:55,888 INFO L225 Difference]: With dead ends: 84 [2018-01-25 03:19:55,888 INFO L226 Difference]: Without dead ends: 80 [2018-01-25 03:19:55,888 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 03:19:55,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-25 03:19:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-25 03:19:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-25 03:19:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-01-25 03:19:55,896 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 15 [2018-01-25 03:19:55,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:55,896 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-01-25 03:19:55,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:19:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-01-25 03:19:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:19:55,897 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:55,898 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:55,898 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:55,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1624122009, now seen corresponding path program 1 times [2018-01-25 03:19:55,898 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:55,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:55,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:55,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:55,900 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:55,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:55,990 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 03:19:55,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:55,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:19:55,991 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:55,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:19:55,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:19:55,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:19:55,992 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 4 states. [2018-01-25 03:19:56,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:56,080 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-01-25 03:19:56,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:19:56,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 03:19:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:56,081 INFO L225 Difference]: With dead ends: 80 [2018-01-25 03:19:56,082 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 03:19:56,082 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 03:19:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 03:19:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-25 03:19:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-25 03:19:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-25 03:19:56,092 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2018-01-25 03:19:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:56,092 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-25 03:19:56,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:19:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-25 03:19:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:19:56,094 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:56,094 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] [2018-01-25 03:19:56,094 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash 146058220, now seen corresponding path program 1 times [2018-01-25 03:19:56,094 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:56,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:56,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:56,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:56,096 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:56,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:56,366 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 03:19:56,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:56,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:19:56,367 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:56,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:19:56,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:19:56,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:19:56,369 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 8 states. [2018-01-25 03:19:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:56,761 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-01-25 03:19:56,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 03:19:56,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 03:19:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:56,763 INFO L225 Difference]: With dead ends: 159 [2018-01-25 03:19:56,763 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 03:19:56,764 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-01-25 03:19:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 03:19:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-01-25 03:19:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-25 03:19:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-01-25 03:19:56,773 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 20 [2018-01-25 03:19:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:56,773 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-01-25 03:19:56,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:19:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-01-25 03:19:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:19:56,776 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:56,776 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, 1, 1, 1] [2018-01-25 03:19:56,777 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash -892550082, now seen corresponding path program 1 times [2018-01-25 03:19:56,777 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:56,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:56,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:56,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:56,778 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:56,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:56,905 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 03:19:56,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:56,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:19:56,906 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:56,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:19:56,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:19:56,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:19:56,907 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 7 states. [2018-01-25 03:19:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:57,169 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-01-25 03:19:57,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:19:57,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-25 03:19:57,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:57,170 INFO L225 Difference]: With dead ends: 99 [2018-01-25 03:19:57,170 INFO L226 Difference]: Without dead ends: 98 [2018-01-25 03:19:57,170 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:19:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-25 03:19:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2018-01-25 03:19:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-25 03:19:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-25 03:19:57,180 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 31 [2018-01-25 03:19:57,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:57,180 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-25 03:19:57,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:19:57,180 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-25 03:19:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:19:57,181 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:57,181 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, 1, 1, 1] [2018-01-25 03:19:57,181 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash -892550081, now seen corresponding path program 1 times [2018-01-25 03:19:57,181 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:57,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:57,182 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:57,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:57,182 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:57,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:57,503 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 03:19:57,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:57,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:19:57,504 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:57,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:19:57,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:19:57,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:19:57,505 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 9 states. [2018-01-25 03:19:57,910 WARN L143 SmtUtils]: Spent 165ms on a formula simplification that was a NOOP. DAG size: 19 [2018-01-25 03:19:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:58,037 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-01-25 03:19:58,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 03:19:58,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-25 03:19:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:58,039 INFO L225 Difference]: With dead ends: 102 [2018-01-25 03:19:58,039 INFO L226 Difference]: Without dead ends: 101 [2018-01-25 03:19:58,040 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:19:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-25 03:19:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 84. [2018-01-25 03:19:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-25 03:19:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-25 03:19:58,050 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 31 [2018-01-25 03:19:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:58,051 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-25 03:19:58,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:19:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-25 03:19:58,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 03:19:58,057 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:58,057 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, 1, 1, 1, 1, 1] [2018-01-25 03:19:58,057 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:58,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1281554978, now seen corresponding path program 1 times [2018-01-25 03:19:58,057 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:58,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:58,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:58,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:58,060 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:58,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:58,146 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 03:19:58,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:58,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:19:58,146 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:58,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:19:58,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:19:58,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:19:58,148 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 3 states. [2018-01-25 03:19:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:58,207 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-01-25 03:19:58,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:19:58,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-01-25 03:19:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:58,209 INFO L225 Difference]: With dead ends: 107 [2018-01-25 03:19:58,209 INFO L226 Difference]: Without dead ends: 87 [2018-01-25 03:19:58,209 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 03:19:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-25 03:19:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-01-25 03:19:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-25 03:19:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-01-25 03:19:58,215 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 33 [2018-01-25 03:19:58,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:58,215 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-01-25 03:19:58,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:19:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-01-25 03:19:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 03:19:58,217 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:58,217 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, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:58,217 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:58,218 INFO L82 PathProgramCache]: Analyzing trace with hash 183041674, now seen corresponding path program 1 times [2018-01-25 03:19:58,218 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:58,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:58,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:58,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:58,219 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:58,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:58,310 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 03:19:58,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:58,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:19:58,311 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:58,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:19:58,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:19:58,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:19:58,312 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 5 states. [2018-01-25 03:19:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:58,517 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-01-25 03:19:58,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:19:58,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-25 03:19:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:58,519 INFO L225 Difference]: With dead ends: 86 [2018-01-25 03:19:58,519 INFO L226 Difference]: Without dead ends: 85 [2018-01-25 03:19:58,520 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:19:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-25 03:19:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-25 03:19:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-25 03:19:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-25 03:19:58,525 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 34 [2018-01-25 03:19:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:58,526 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-25 03:19:58,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:19:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-25 03:19:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 03:19:58,527 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:58,527 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, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:58,527 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash 183041675, now seen corresponding path program 1 times [2018-01-25 03:19:58,528 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:58,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:58,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:58,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:58,529 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:58,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:58,777 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 03:19:58,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:58,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 03:19:58,778 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:58,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 03:19:58,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 03:19:58,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:19:58,779 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 11 states. [2018-01-25 03:19:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:59,171 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-01-25 03:19:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 03:19:59,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-01-25 03:19:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:59,173 INFO L225 Difference]: With dead ends: 88 [2018-01-25 03:19:59,173 INFO L226 Difference]: Without dead ends: 87 [2018-01-25 03:19:59,173 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-01-25 03:19:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-25 03:19:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-01-25 03:19:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-25 03:19:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-25 03:19:59,179 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 34 [2018-01-25 03:19:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:59,179 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-25 03:19:59,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 03:19:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-25 03:19:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 03:19:59,181 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:59,181 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:59,181 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1082481281, now seen corresponding path program 1 times [2018-01-25 03:19:59,181 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:59,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:59,183 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:59,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:59,183 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:59,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:59,233 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 03:19:59,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:59,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:19:59,233 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:59,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:19:59,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:19:59,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:19:59,234 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 4 states. [2018-01-25 03:19:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:59,276 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-01-25 03:19:59,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:19:59,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-25 03:19:59,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:59,277 INFO L225 Difference]: With dead ends: 90 [2018-01-25 03:19:59,278 INFO L226 Difference]: Without dead ends: 83 [2018-01-25 03:19:59,278 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:19:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-25 03:19:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-01-25 03:19:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 03:19:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-01-25 03:19:59,284 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 35 [2018-01-25 03:19:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:59,284 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-01-25 03:19:59,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:19:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-01-25 03:19:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 03:19:59,286 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:59,286 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:59,287 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:19:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1379324610, now seen corresponding path program 1 times [2018-01-25 03:19:59,288 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:59,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:59,289 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:59,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:59,289 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:59,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:59,691 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 03:19:59,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:59,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 03:19:59,691 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:59,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 03:19:59,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 03:19:59,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-25 03:19:59,693 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 15 states. [2018-01-25 03:20:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:00,671 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-01-25 03:20:00,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 03:20:00,672 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-01-25 03:20:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:00,674 INFO L225 Difference]: With dead ends: 115 [2018-01-25 03:20:00,674 INFO L226 Difference]: Without dead ends: 114 [2018-01-25 03:20:00,675 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-01-25 03:20:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-25 03:20:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-01-25 03:20:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 03:20:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-01-25 03:20:00,682 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 35 [2018-01-25 03:20:00,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:00,682 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-01-25 03:20:00,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 03:20:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-01-25 03:20:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 03:20:00,684 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:00,684 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:00,684 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:20:00,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1379324611, now seen corresponding path program 1 times [2018-01-25 03:20:00,684 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:00,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:00,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:00,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:00,685 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:00,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:01,106 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 03:20:01,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:01,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 03:20:01,107 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:01,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 03:20:01,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 03:20:01,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-25 03:20:01,108 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 15 states. [2018-01-25 03:20:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:01,623 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-01-25 03:20:01,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 03:20:01,623 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-01-25 03:20:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:01,624 INFO L225 Difference]: With dead ends: 105 [2018-01-25 03:20:01,624 INFO L226 Difference]: Without dead ends: 104 [2018-01-25 03:20:01,625 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-01-25 03:20:01,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-25 03:20:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-01-25 03:20:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 03:20:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-01-25 03:20:01,630 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 35 [2018-01-25 03:20:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:01,630 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-01-25 03:20:01,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 03:20:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-01-25 03:20:01,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 03:20:01,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:01,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:01,631 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:20:01,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1613943773, now seen corresponding path program 1 times [2018-01-25 03:20:01,631 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:01,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:01,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:01,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:01,632 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:01,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:02,080 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 03:20:02,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:02,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 03:20:02,081 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:02,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 03:20:02,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 03:20:02,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:20:02,082 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 17 states. [2018-01-25 03:20:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:02,663 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-01-25 03:20:02,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-25 03:20:02,663 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-01-25 03:20:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:02,664 INFO L225 Difference]: With dead ends: 122 [2018-01-25 03:20:02,664 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 03:20:02,665 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2018-01-25 03:20:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 03:20:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-01-25 03:20:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-25 03:20:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-25 03:20:02,672 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 37 [2018-01-25 03:20:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:02,673 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-25 03:20:02,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 03:20:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-25 03:20:02,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 03:20:02,674 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:02,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:02,674 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:20:02,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1507350608, now seen corresponding path program 1 times [2018-01-25 03:20:02,674 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:02,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:02,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:02,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:02,676 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:02,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:02,777 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 03:20:02,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:02,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:20:02,777 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:02,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:20:02,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:20:02,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:20:02,778 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 8 states. [2018-01-25 03:20:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:02,865 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-01-25 03:20:02,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:20:02,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-25 03:20:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:02,866 INFO L225 Difference]: With dead ends: 109 [2018-01-25 03:20:02,867 INFO L226 Difference]: Without dead ends: 108 [2018-01-25 03:20:02,867 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:20:02,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-25 03:20:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-01-25 03:20:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-25 03:20:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-01-25 03:20:02,875 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 38 [2018-01-25 03:20:02,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:02,875 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-01-25 03:20:02,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:20:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-01-25 03:20:02,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 03:20:02,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:02,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:02,877 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:20:02,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1507350609, now seen corresponding path program 1 times [2018-01-25 03:20:02,877 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:02,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:02,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:02,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:02,878 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:02,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:03,500 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 03:20:03,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:03,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 03:20:03,501 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:03,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 03:20:03,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 03:20:03,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-25 03:20:03,502 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 15 states. [2018-01-25 03:20:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:04,346 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-01-25 03:20:04,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 03:20:04,346 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-01-25 03:20:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:04,347 INFO L225 Difference]: With dead ends: 119 [2018-01-25 03:20:04,347 INFO L226 Difference]: Without dead ends: 118 [2018-01-25 03:20:04,348 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-01-25 03:20:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-25 03:20:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2018-01-25 03:20:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-25 03:20:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-25 03:20:04,354 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 38 [2018-01-25 03:20:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:04,355 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-25 03:20:04,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 03:20:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-25 03:20:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 03:20:04,355 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:04,355 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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 03:20:04,355 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:20:04,356 INFO L82 PathProgramCache]: Analyzing trace with hash 563388428, now seen corresponding path program 1 times [2018-01-25 03:20:04,356 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:04,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:04,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:04,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:04,357 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:04,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:20:04,586 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:20:04,586 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:20:04,587 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-01-25 03:20:04,589 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [13], [15], [17], [22], [95], [96], [97], [98], [101], [104], [105], [110], [111], [115], [119], [120], [121], [123], [126], [127], [130], [131], [132], [133], [135], [136] [2018-01-25 03:20:04,659 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:20:04,659 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