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_mostprecise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:12:47,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:12:47,252 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:12:47,264 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:12:47,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:12:47,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:12:47,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:12:47,268 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:12:47,270 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:12:47,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:12:47,271 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:12:47,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:12:47,272 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:12:47,273 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:12:47,274 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:12:47,277 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:12:47,279 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:12:47,281 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:12:47,282 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:12:47,284 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:12:47,286 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:12:47,286 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:12:47,286 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:12:47,287 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:12:47,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:12:47,289 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:12:47,290 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:12:47,290 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:12:47,290 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:12:47,291 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:12:47,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:12:47,292 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_mostprecise.epf [2018-01-24 20:12:47,301 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:12:47,302 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:12:47,303 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:12:47,303 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:12:47,303 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:12:47,303 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:12:47,304 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:12:47,304 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:12:47,304 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:12:47,305 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:12:47,305 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:12:47,305 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:12:47,305 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:12:47,305 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:12:47,306 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:12:47,306 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:12:47,306 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:12:47,306 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:12:47,306 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:12:47,307 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:12:47,307 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:12:47,307 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:12:47,307 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:12:47,307 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:12:47,308 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:12:47,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:12:47,308 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:12:47,308 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:12:47,309 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:12:47,309 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:12:47,309 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:12:47,309 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:12:47,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:12:47,310 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:12:47,310 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:12:47,311 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:12:47,311 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:12:47,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:12:47,358 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:12:47,362 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:12:47,363 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:12:47,364 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:12:47,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_true-valid-memsafety.i [2018-01-24 20:12:47,547 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:12:47,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:12:47,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:12:47,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:12:47,563 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:12:47,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:12:47" (1/1) ... [2018-01-24 20:12:47,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e82129b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:12:47, skipping insertion in model container [2018-01-24 20:12:47,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:12:47" (1/1) ... [2018-01-24 20:12:47,588 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:12:47,631 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:12:47,754 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:12:47,771 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:12:47,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:12:47 WrapperNode [2018-01-24 20:12:47,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:12:47,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:12:47,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:12:47,777 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:12:47,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:12:47" (1/1) ... [2018-01-24 20:12:47,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:12:47" (1/1) ... [2018-01-24 20:12:47,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:12:47" (1/1) ... [2018-01-24 20:12:47,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:12:47" (1/1) ... [2018-01-24 20:12:47,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:12:47" (1/1) ... [2018-01-24 20:12:47,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:12:47" (1/1) ... [2018-01-24 20:12:47,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:12:47" (1/1) ... [2018-01-24 20:12:47,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:12:47,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:12:47,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:12:47,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:12:47,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:12:47" (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-24 20:12:47,857 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:12:47,858 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:12:47,858 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 20:12:47,858 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:12:47,858 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:12:47,858 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:12:47,858 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:12:47,859 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:12:47,859 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:12:47,859 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:12:47,859 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:12:47,859 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:12:47,859 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 20:12:47,860 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:12:47,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:12:47,860 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:12:48,280 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:12:48,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:12:48 BoogieIcfgContainer [2018-01-24 20:12:48,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:12:48,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:12:48,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:12:48,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:12:48,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:12:47" (1/3) ... [2018-01-24 20:12:48,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f86d1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:12:48, skipping insertion in model container [2018-01-24 20:12:48,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:12:47" (2/3) ... [2018-01-24 20:12:48,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f86d1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:12:48, skipping insertion in model container [2018-01-24 20:12:48,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:12:48" (3/3) ... [2018-01-24 20:12:48,287 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_true-valid-memsafety.i [2018-01-24 20:12:48,294 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:12:48,301 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-01-24 20:12:48,339 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:12:48,340 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:12:48,340 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:12:48,340 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:12:48,340 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:12:48,340 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:12:48,340 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:12:48,340 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:12:48,341 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:12:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2018-01-24 20:12:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 20:12:48,367 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:48,368 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:12:48,368 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:48,372 INFO L82 PathProgramCache]: Analyzing trace with hash -473238968, now seen corresponding path program 1 times [2018-01-24 20:12:48,375 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:48,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:48,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:48,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:48,418 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:48,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:48,513 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-24 20:12:48,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:48,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:12:48,515 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:48,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:12:48,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:12:48,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:12:48,530 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 3 states. [2018-01-24 20:12:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:48,793 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2018-01-24 20:12:48,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:12:48,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 20:12:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:48,807 INFO L225 Difference]: With dead ends: 164 [2018-01-24 20:12:48,807 INFO L226 Difference]: Without dead ends: 99 [2018-01-24 20:12:48,810 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-24 20:12:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-24 20:12:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-01-24 20:12:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 20:12:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-01-24 20:12:48,855 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 7 [2018-01-24 20:12:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:48,856 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-01-24 20:12:48,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:12:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-01-24 20:12:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 20:12:48,856 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:48,856 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:12:48,856 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:48,857 INFO L82 PathProgramCache]: Analyzing trace with hash -473238967, now seen corresponding path program 1 times [2018-01-24 20:12:48,857 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:48,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:48,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:48,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:48,859 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:48,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:48,941 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-24 20:12:48,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:48,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:12:48,941 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:48,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:12:48,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:12:48,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:12:48,943 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 3 states. [2018-01-24 20:12:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:49,050 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-01-24 20:12:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:12:49,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 20:12:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:49,053 INFO L225 Difference]: With dead ends: 99 [2018-01-24 20:12:49,053 INFO L226 Difference]: Without dead ends: 98 [2018-01-24 20:12:49,054 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-24 20:12:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-24 20:12:49,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-01-24 20:12:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 20:12:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2018-01-24 20:12:49,064 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 7 [2018-01-24 20:12:49,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:49,065 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2018-01-24 20:12:49,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:12:49,065 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2018-01-24 20:12:49,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 20:12:49,065 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:49,066 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:12:49,066 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:49,066 INFO L82 PathProgramCache]: Analyzing trace with hash -799395641, now seen corresponding path program 1 times [2018-01-24 20:12:49,066 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:49,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:49,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:49,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:49,068 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:49,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:49,158 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-24 20:12:49,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:49,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:12:49,159 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:49,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:12:49,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:12:49,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:12:49,160 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 5 states. [2018-01-24 20:12:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:49,355 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-01-24 20:12:49,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:12:49,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 20:12:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:49,356 INFO L225 Difference]: With dead ends: 96 [2018-01-24 20:12:49,356 INFO L226 Difference]: Without dead ends: 93 [2018-01-24 20:12:49,357 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-24 20:12:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-24 20:12:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-24 20:12:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 20:12:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-24 20:12:49,366 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 13 [2018-01-24 20:12:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:49,367 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-24 20:12:49,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:12:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-24 20:12:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 20:12:49,368 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:49,368 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:12:49,368 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash -799395640, now seen corresponding path program 1 times [2018-01-24 20:12:49,368 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:49,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:49,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:49,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:49,370 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:49,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:49,560 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-24 20:12:49,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:49,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:12:49,560 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:49,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 20:12:49,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 20:12:49,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:12:49,562 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 7 states. [2018-01-24 20:12:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:49,756 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-01-24 20:12:49,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:12:49,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-01-24 20:12:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:49,757 INFO L225 Difference]: With dead ends: 93 [2018-01-24 20:12:49,757 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 20:12:49,758 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:12:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 20:12:49,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-24 20:12:49,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 20:12:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-01-24 20:12:49,762 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 13 [2018-01-24 20:12:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:49,763 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-01-24 20:12:49,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 20:12:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-01-24 20:12:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 20:12:49,763 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:49,763 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:12:49,763 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:49,764 INFO L82 PathProgramCache]: Analyzing trace with hash 988538978, now seen corresponding path program 1 times [2018-01-24 20:12:49,764 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:49,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:49,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:49,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:49,765 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:49,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:49,812 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-24 20:12:49,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:49,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:12:49,814 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:49,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:12:49,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:12:49,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:12:49,814 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 4 states. [2018-01-24 20:12:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:49,906 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-01-24 20:12:49,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:12:49,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 20:12:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:49,907 INFO L225 Difference]: With dead ends: 82 [2018-01-24 20:12:49,908 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 20:12:49,908 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-24 20:12:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 20:12:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-24 20:12:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 20:12:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-24 20:12:49,915 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 14 [2018-01-24 20:12:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:49,916 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-24 20:12:49,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:12:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-24 20:12:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 20:12:49,917 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:49,917 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:12:49,917 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash 988538979, now seen corresponding path program 1 times [2018-01-24 20:12:49,918 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:49,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:49,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:49,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:49,919 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:49,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:49,985 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-24 20:12:49,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:49,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:12:49,985 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:49,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:12:49,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:12:49,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:12:49,986 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 4 states. [2018-01-24 20:12:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:50,045 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-01-24 20:12:50,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:12:50,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 20:12:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:50,046 INFO L225 Difference]: With dead ends: 78 [2018-01-24 20:12:50,046 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 20:12:50,046 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-24 20:12:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 20:12:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 20:12:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 20:12:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-01-24 20:12:50,053 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 14 [2018-01-24 20:12:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:50,053 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-01-24 20:12:50,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:12:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-01-24 20:12:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 20:12:50,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:50,054 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:12:50,055 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:50,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1876114930, now seen corresponding path program 1 times [2018-01-24 20:12:50,055 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:50,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:50,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:50,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:50,056 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:50,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:50,165 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-24 20:12:50,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:50,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:12:50,165 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:50,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 20:12:50,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 20:12:50,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:12:50,166 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 8 states. [2018-01-24 20:12:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:50,349 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2018-01-24 20:12:50,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 20:12:50,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 20:12:50,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:50,351 INFO L225 Difference]: With dead ends: 156 [2018-01-24 20:12:50,351 INFO L226 Difference]: Without dead ends: 89 [2018-01-24 20:12:50,352 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-01-24 20:12:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-24 20:12:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2018-01-24 20:12:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 20:12:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-24 20:12:50,360 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 19 [2018-01-24 20:12:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:50,360 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-24 20:12:50,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 20:12:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-24 20:12:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 20:12:50,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:50,363 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] [2018-01-24 20:12:50,363 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:50,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1475130712, now seen corresponding path program 1 times [2018-01-24 20:12:50,363 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:50,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:50,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:50,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:50,364 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:50,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:50,451 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-24 20:12:50,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:50,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:12:50,452 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:50,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 20:12:50,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 20:12:50,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:12:50,453 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 7 states. [2018-01-24 20:12:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:50,616 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-01-24 20:12:50,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 20:12:50,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-24 20:12:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:50,617 INFO L225 Difference]: With dead ends: 98 [2018-01-24 20:12:50,617 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 20:12:50,617 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-24 20:12:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 20:12:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2018-01-24 20:12:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 20:12:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-24 20:12:50,624 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 30 [2018-01-24 20:12:50,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:50,624 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-24 20:12:50,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 20:12:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-24 20:12:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 20:12:50,626 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:50,626 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] [2018-01-24 20:12:50,626 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:50,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1475130713, now seen corresponding path program 1 times [2018-01-24 20:12:50,626 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:50,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:50,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:50,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:50,627 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:50,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:50,845 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-24 20:12:50,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:50,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:12:50,846 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:50,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 20:12:50,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 20:12:50,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 20:12:50,846 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 9 states. [2018-01-24 20:12:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:51,083 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-01-24 20:12:51,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 20:12:51,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-24 20:12:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:51,084 INFO L225 Difference]: With dead ends: 101 [2018-01-24 20:12:51,084 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 20:12:51,085 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-24 20:12:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 20:12:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-01-24 20:12:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 20:12:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-01-24 20:12:51,089 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 30 [2018-01-24 20:12:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:51,090 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-01-24 20:12:51,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 20:12:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-01-24 20:12:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 20:12:51,091 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:51,091 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-24 20:12:51,092 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:51,092 INFO L82 PathProgramCache]: Analyzing trace with hash 374430840, now seen corresponding path program 1 times [2018-01-24 20:12:51,092 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:51,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:51,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:51,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:51,093 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:51,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:51,167 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-24 20:12:51,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:51,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:12:51,167 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:51,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:12:51,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:12:51,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:12:51,168 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 5 states. [2018-01-24 20:12:51,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:51,230 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-01-24 20:12:51,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:12:51,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 20:12:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:51,231 INFO L225 Difference]: With dead ends: 108 [2018-01-24 20:12:51,231 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 20:12:51,232 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:12:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 20:12:51,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-01-24 20:12:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-24 20:12:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-24 20:12:51,236 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 33 [2018-01-24 20:12:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:51,236 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-24 20:12:51,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:12:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-24 20:12:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 20:12:51,237 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:51,237 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-24 20:12:51,237 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:51,237 INFO L82 PathProgramCache]: Analyzing trace with hash -486325487, now seen corresponding path program 1 times [2018-01-24 20:12:51,237 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:51,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:51,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:51,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:51,238 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:51,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:51,305 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-24 20:12:51,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:51,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:12:51,305 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:51,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:12:51,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:12:51,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:12:51,306 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 5 states. [2018-01-24 20:12:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:51,460 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-01-24 20:12:51,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:12:51,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 20:12:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:51,461 INFO L225 Difference]: With dead ends: 85 [2018-01-24 20:12:51,461 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 20:12:51,462 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-24 20:12:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 20:12:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-24 20:12:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 20:12:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-24 20:12:51,467 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 33 [2018-01-24 20:12:51,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:51,468 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-24 20:12:51,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:12:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-24 20:12:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 20:12:51,469 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:51,469 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-24 20:12:51,469 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:51,469 INFO L82 PathProgramCache]: Analyzing trace with hash -486325486, now seen corresponding path program 1 times [2018-01-24 20:12:51,469 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:51,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:51,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:51,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:51,470 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:51,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:12:51,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:51,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 20:12:51,784 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:51,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 20:12:51,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 20:12:51,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-24 20:12:51,785 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 11 states. [2018-01-24 20:12:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:51,986 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-01-24 20:12:51,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 20:12:51,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-24 20:12:51,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:51,988 INFO L225 Difference]: With dead ends: 87 [2018-01-24 20:12:51,988 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 20:12:51,988 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-01-24 20:12:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 20:12:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-01-24 20:12:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 20:12:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-24 20:12:51,992 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 33 [2018-01-24 20:12:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:51,993 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-24 20:12:51,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 20:12:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-24 20:12:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 20:12:51,995 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:51,995 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-24 20:12:51,995 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:51,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2103779100, now seen corresponding path program 1 times [2018-01-24 20:12:51,995 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:51,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:51,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:51,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:51,997 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:52,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:52,429 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-24 20:12:52,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:52,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 20:12:52,429 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:52,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 20:12:52,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 20:12:52,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-24 20:12:52,430 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 15 states. [2018-01-24 20:12:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:53,121 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-24 20:12:53,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 20:12:53,137 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 20:12:53,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:53,138 INFO L225 Difference]: With dead ends: 122 [2018-01-24 20:12:53,138 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 20:12:53,139 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-01-24 20:12:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 20:12:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2018-01-24 20:12:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 20:12:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-01-24 20:12:53,145 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 34 [2018-01-24 20:12:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:53,146 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-01-24 20:12:53,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 20:12:53,146 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-01-24 20:12:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 20:12:53,147 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:53,147 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-24 20:12:53,147 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:53,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2103779101, now seen corresponding path program 1 times [2018-01-24 20:12:53,148 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:53,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:53,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:53,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:53,149 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:53,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:53,642 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-24 20:12:53,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:53,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 20:12:53,643 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:53,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 20:12:53,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 20:12:53,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-24 20:12:53,644 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 15 states. [2018-01-24 20:12:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:54,165 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-01-24 20:12:54,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 20:12:54,165 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 20:12:54,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:54,166 INFO L225 Difference]: With dead ends: 111 [2018-01-24 20:12:54,167 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 20:12:54,167 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-01-24 20:12:54,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 20:12:54,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2018-01-24 20:12:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 20:12:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-24 20:12:54,173 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 34 [2018-01-24 20:12:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:54,174 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-24 20:12:54,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 20:12:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-24 20:12:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 20:12:54,175 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:54,175 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-24 20:12:54,175 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:54,175 INFO L82 PathProgramCache]: Analyzing trace with hash -950447499, now seen corresponding path program 1 times [2018-01-24 20:12:54,175 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:54,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:54,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:54,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:54,176 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:54,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:54,331 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-24 20:12:54,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:54,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:12:54,332 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:54,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 20:12:54,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 20:12:54,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:12:54,333 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 8 states. [2018-01-24 20:12:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:54,487 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-01-24 20:12:54,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 20:12:54,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-24 20:12:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:54,488 INFO L225 Difference]: With dead ends: 103 [2018-01-24 20:12:54,488 INFO L226 Difference]: Without dead ends: 95 [2018-01-24 20:12:54,488 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 20:12:54,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-24 20:12:54,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-24 20:12:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 20:12:54,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-01-24 20:12:54,495 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 35 [2018-01-24 20:12:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:54,495 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-01-24 20:12:54,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 20:12:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-01-24 20:12:54,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 20:12:54,496 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:54,496 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] [2018-01-24 20:12:54,497 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:54,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1197880803, now seen corresponding path program 1 times [2018-01-24 20:12:54,497 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:54,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:54,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:54,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:54,498 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:54,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:54,826 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-24 20:12:54,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:54,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 20:12:54,827 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:54,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 20:12:54,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 20:12:54,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-24 20:12:54,827 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 15 states. [2018-01-24 20:12:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:55,765 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2018-01-24 20:12:55,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 20:12:55,765 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 20:12:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:55,766 INFO L225 Difference]: With dead ends: 134 [2018-01-24 20:12:55,766 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 20:12:55,767 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2018-01-24 20:12:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 20:12:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 107. [2018-01-24 20:12:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 20:12:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-01-24 20:12:55,773 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 36 [2018-01-24 20:12:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:55,774 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-01-24 20:12:55,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 20:12:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-01-24 20:12:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 20:12:55,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:55,775 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-24 20:12:55,775 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1520400791, now seen corresponding path program 1 times [2018-01-24 20:12:55,775 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:55,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:55,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:55,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:55,776 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:55,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:55,870 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-24 20:12:55,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:55,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 20:12:55,870 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:55,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 20:12:55,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 20:12:55,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:12:55,871 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 8 states. [2018-01-24 20:12:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:56,031 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2018-01-24 20:12:56,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 20:12:56,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-24 20:12:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:56,032 INFO L225 Difference]: With dead ends: 107 [2018-01-24 20:12:56,032 INFO L226 Difference]: Without dead ends: 106 [2018-01-24 20:12:56,033 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 20:12:56,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-24 20:12:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-24 20:12:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 20:12:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-01-24 20:12:56,037 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 37 [2018-01-24 20:12:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:56,038 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-01-24 20:12:56,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 20:12:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-01-24 20:12:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 20:12:56,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:56,038 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-24 20:12:56,038 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:56,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1520400792, now seen corresponding path program 1 times [2018-01-24 20:12:56,039 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:56,039 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:56,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:56,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:56,040 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:56,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:56,404 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 22 DAG size of output 14 [2018-01-24 20:12:56,605 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 33 DAG size of output 27 [2018-01-24 20:12:56,710 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-24 20:12:56,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:12:56,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 20:12:56,710 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:12:56,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 20:12:56,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 20:12:56,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-24 20:12:56,711 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 15 states. [2018-01-24 20:12:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:12:57,139 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-24 20:12:57,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 20:12:57,139 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-01-24 20:12:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:12:57,140 INFO L225 Difference]: With dead ends: 117 [2018-01-24 20:12:57,140 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 20:12:57,141 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-01-24 20:12:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 20:12:57,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-01-24 20:12:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 20:12:57,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-01-24 20:12:57,147 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 37 [2018-01-24 20:12:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:12:57,147 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-01-24 20:12:57,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 20:12:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-01-24 20:12:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 20:12:57,147 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:12:57,148 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] [2018-01-24 20:12:57,148 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:12:57,148 INFO L82 PathProgramCache]: Analyzing trace with hash -482433028, now seen corresponding path program 1 times [2018-01-24 20:12:57,148 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:12:57,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:57,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:12:57,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:12:57,149 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:12:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:12:57,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:12:57,353 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-24 20:12:57,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:12:57,354 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:12:57,354 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-24 20:12:57,355 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [12], [15], [20], [97], [98], [99], [100], [103], [106], [107], [112], [113], [117], [121], [122], [123], [125], [128], [129], [132], [133], [134], [135], [137], [138] [2018-01-24 20:12:57,401 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:12:57,401 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