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_precise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:36:36,085 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:36:36,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:36:36,102 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:36:36,103 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:36:36,104 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:36:36,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:36:36,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:36:36,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:36:36,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:36:36,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:36:36,110 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:36:36,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:36:36,112 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:36:36,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:36:36,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:36:36,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:36:36,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:36:36,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:36:36,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:36:36,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:36:36,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:36:36,125 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:36:36,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:36:36,127 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:36:36,128 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:36:36,129 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:36:36,129 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:36:36,130 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:36:36,130 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:36:36,130 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:36:36,131 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_precise.epf [2018-01-24 23:36:36,139 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:36:36,139 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:36:36,140 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:36:36,140 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:36:36,140 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:36:36,140 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:36:36,141 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:36:36,141 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:36:36,141 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:36:36,141 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:36:36,141 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:36:36,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:36:36,142 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:36:36,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:36:36,142 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:36:36,142 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:36:36,142 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:36:36,142 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:36:36,142 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:36:36,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:36:36,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:36:36,143 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:36:36,143 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:36:36,143 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:36:36,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:36:36,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:36:36,144 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:36:36,144 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:36:36,144 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:36:36,144 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:36:36,144 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:36:36,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:36:36,144 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:36:36,145 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:36:36,145 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:36:36,145 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:36:36,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:36:36,188 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:36:36,192 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:36:36,193 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:36:36,193 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:36:36,194 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 23:36:36,348 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:36:36,351 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:36:36,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:36:36,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:36:36,357 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:36:36,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:36:36" (1/1) ... [2018-01-24 23:36:36,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d17d7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:36:36, skipping insertion in model container [2018-01-24 23:36:36,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:36:36" (1/1) ... [2018-01-24 23:36:36,375 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:36:36,412 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:36:36,527 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:36:36,545 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:36:36,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:36:36 WrapperNode [2018-01-24 23:36:36,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:36:36,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:36:36,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:36:36,555 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:36:36,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:36:36" (1/1) ... [2018-01-24 23:36:36,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:36:36" (1/1) ... [2018-01-24 23:36:36,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:36:36" (1/1) ... [2018-01-24 23:36:36,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:36:36" (1/1) ... [2018-01-24 23:36:36,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:36:36" (1/1) ... [2018-01-24 23:36:36,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:36:36" (1/1) ... [2018-01-24 23:36:36,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:36:36" (1/1) ... [2018-01-24 23:36:36,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:36:36,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:36:36,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:36:36,588 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:36:36,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:36:36" (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 23:36:36,634 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:36:36,635 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:36:36,635 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 23:36:36,635 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:36:36,635 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 23:36:36,635 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 23:36:36,635 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:36:36,635 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:36:36,635 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:36:36,635 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 23:36:36,636 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 23:36:36,636 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:36:36,636 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 23:36:36,636 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:36:36,636 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:36:36,636 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:36:37,026 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:36:37,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:36:37 BoogieIcfgContainer [2018-01-24 23:36:37,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:36:37,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:36:37,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:36:37,073 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:36:37,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:36:36" (1/3) ... [2018-01-24 23:36:37,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e69e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:36:37, skipping insertion in model container [2018-01-24 23:36:37,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:36:36" (2/3) ... [2018-01-24 23:36:37,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e69e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:36:37, skipping insertion in model container [2018-01-24 23:36:37,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:36:37" (3/3) ... [2018-01-24 23:36:37,075 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_true-valid-memsafety.i [2018-01-24 23:36:37,082 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:36:37,088 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-01-24 23:36:37,131 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:36:37,131 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:36:37,132 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:36:37,132 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:36:37,132 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:36:37,132 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:36:37,132 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:36:37,132 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:36:37,133 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:36:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2018-01-24 23:36:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 23:36:37,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:37,159 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:36:37,159 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 23:36:37,164 INFO L82 PathProgramCache]: Analyzing trace with hash -473238968, now seen corresponding path program 1 times [2018-01-24 23:36:37,166 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:37,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:37,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:37,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:37,214 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:37,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:37,327 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 23:36:37,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:37,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:36:37,331 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:37,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:36:37,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:36:37,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:36:37,352 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 3 states. [2018-01-24 23:36:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:37,597 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2018-01-24 23:36:37,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:36:37,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 23:36:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:37,611 INFO L225 Difference]: With dead ends: 164 [2018-01-24 23:36:37,611 INFO L226 Difference]: Without dead ends: 99 [2018-01-24 23:36:37,615 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 23:36:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-24 23:36:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-01-24 23:36:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 23:36:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-01-24 23:36:37,661 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 7 [2018-01-24 23:36:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:37,662 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-01-24 23:36:37,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:36:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-01-24 23:36:37,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 23:36:37,662 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:37,662 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:36:37,663 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 23:36:37,663 INFO L82 PathProgramCache]: Analyzing trace with hash -473238967, now seen corresponding path program 1 times [2018-01-24 23:36:37,663 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:37,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:37,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:37,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:37,664 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:37,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:37,764 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 23:36:37,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:37,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:36:37,765 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:37,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:36:37,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:36:37,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:36:37,767 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 3 states. [2018-01-24 23:36:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:37,868 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-01-24 23:36:37,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:36:37,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 23:36:37,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:37,869 INFO L225 Difference]: With dead ends: 99 [2018-01-24 23:36:37,869 INFO L226 Difference]: Without dead ends: 98 [2018-01-24 23:36:37,870 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 23:36:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-24 23:36:37,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-01-24 23:36:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 23:36:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2018-01-24 23:36:37,877 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 7 [2018-01-24 23:36:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:37,877 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2018-01-24 23:36:37,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:36:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2018-01-24 23:36:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:36:37,878 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:37,878 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:36:37,878 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 23:36:37,878 INFO L82 PathProgramCache]: Analyzing trace with hash -799395641, now seen corresponding path program 1 times [2018-01-24 23:36:37,878 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:37,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:37,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:37,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:37,879 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:37,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:37,965 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 23:36:37,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:37,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:36:37,966 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:37,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:36:37,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:36:37,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:36:37,967 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand 5 states. [2018-01-24 23:36:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:38,200 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-01-24 23:36:38,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:36:38,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 23:36:38,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:38,201 INFO L225 Difference]: With dead ends: 96 [2018-01-24 23:36:38,201 INFO L226 Difference]: Without dead ends: 93 [2018-01-24 23:36:38,202 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 23:36:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-24 23:36:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-24 23:36:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 23:36:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-24 23:36:38,213 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 13 [2018-01-24 23:36:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:38,213 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-24 23:36:38,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:36:38,214 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-24 23:36:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:36:38,214 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:38,214 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:36:38,215 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 23:36:38,215 INFO L82 PathProgramCache]: Analyzing trace with hash -799395640, now seen corresponding path program 1 times [2018-01-24 23:36:38,215 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:38,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:38,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:38,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:38,216 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:38,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:38,354 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 23:36:38,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:38,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:36:38,355 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:38,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:36:38,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:36:38,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:36:38,356 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 7 states. [2018-01-24 23:36:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:38,541 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-01-24 23:36:38,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:36:38,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-01-24 23:36:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:38,543 INFO L225 Difference]: With dead ends: 93 [2018-01-24 23:36:38,543 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 23:36:38,543 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:36:38,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 23:36:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-24 23:36:38,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 23:36:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-01-24 23:36:38,548 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 13 [2018-01-24 23:36:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:38,548 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-01-24 23:36:38,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:36:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-01-24 23:36:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:36:38,549 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:38,549 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:36:38,549 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 23:36:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash 988538978, now seen corresponding path program 1 times [2018-01-24 23:36:38,549 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:38,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:38,550 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:38,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:38,551 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:38,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:38,599 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 23:36:38,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:38,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:36:38,600 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:38,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:36:38,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:36:38,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:36:38,601 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 4 states. [2018-01-24 23:36:38,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:38,695 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-01-24 23:36:38,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:36:38,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:36:38,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:38,696 INFO L225 Difference]: With dead ends: 82 [2018-01-24 23:36:38,696 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 23:36:38,697 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 23:36:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 23:36:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-24 23:36:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 23:36:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-24 23:36:38,702 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 14 [2018-01-24 23:36:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:38,703 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-24 23:36:38,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:36:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-24 23:36:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:36:38,704 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:38,704 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:36:38,704 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 23:36:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash 988538979, now seen corresponding path program 1 times [2018-01-24 23:36:38,705 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:38,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:38,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:38,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:38,706 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:38,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:38,768 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 23:36:38,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:38,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:36:38,768 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:38,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:36:38,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:36:38,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:36:38,769 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 4 states. [2018-01-24 23:36:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:38,817 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-01-24 23:36:38,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:36:38,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:36:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:38,818 INFO L225 Difference]: With dead ends: 78 [2018-01-24 23:36:38,818 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 23:36:38,818 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 23:36:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 23:36:38,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 23:36:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 23:36:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-01-24 23:36:38,823 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 14 [2018-01-24 23:36:38,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:38,823 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-01-24 23:36:38,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:36:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-01-24 23:36:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:36:38,824 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:38,824 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 23:36:38,824 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 23:36:38,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1876114930, now seen corresponding path program 1 times [2018-01-24 23:36:38,824 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:38,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:38,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:38,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:38,825 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:38,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:38,921 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 23:36:38,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:38,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:36:38,922 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:38,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:36:38,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:36:38,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:36:38,923 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 8 states. [2018-01-24 23:36:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:39,109 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2018-01-24 23:36:39,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 23:36:39,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 23:36:39,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:39,110 INFO L225 Difference]: With dead ends: 156 [2018-01-24 23:36:39,110 INFO L226 Difference]: Without dead ends: 89 [2018-01-24 23:36:39,111 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 23:36:39,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-24 23:36:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2018-01-24 23:36:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 23:36:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-24 23:36:39,119 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 19 [2018-01-24 23:36:39,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:39,119 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-24 23:36:39,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:36:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-24 23:36:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 23:36:39,121 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:39,121 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 23:36:39,122 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 23:36:39,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1475130712, now seen corresponding path program 1 times [2018-01-24 23:36:39,122 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:39,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:39,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:39,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:39,123 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:39,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:39,213 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 23:36:39,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:39,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:36:39,214 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:39,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:36:39,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:36:39,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:36:39,215 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 7 states. [2018-01-24 23:36:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:39,381 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-01-24 23:36:39,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:36:39,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-24 23:36:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:39,382 INFO L225 Difference]: With dead ends: 98 [2018-01-24 23:36:39,382 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 23:36:39,383 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 23:36:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 23:36:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2018-01-24 23:36:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 23:36:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-24 23:36:39,390 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 30 [2018-01-24 23:36:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:39,390 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-24 23:36:39,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:36:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-24 23:36:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 23:36:39,391 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:39,391 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 23:36:39,391 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 23:36:39,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1475130713, now seen corresponding path program 1 times [2018-01-24 23:36:39,392 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:39,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:39,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:39,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:39,393 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:39,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:39,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 23:36:39,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:39,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:36:39,561 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:39,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:36:39,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:36:39,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:36:39,562 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 9 states. [2018-01-24 23:36:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:39,762 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-01-24 23:36:39,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 23:36:39,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-24 23:36:39,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:39,764 INFO L225 Difference]: With dead ends: 101 [2018-01-24 23:36:39,764 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 23:36:39,764 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-24 23:36:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 23:36:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-01-24 23:36:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 23:36:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-01-24 23:36:39,770 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 30 [2018-01-24 23:36:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:39,770 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-01-24 23:36:39,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:36:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-01-24 23:36:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 23:36:39,771 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:39,772 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 23:36:39,772 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 23:36:39,772 INFO L82 PathProgramCache]: Analyzing trace with hash 374430840, now seen corresponding path program 1 times [2018-01-24 23:36:39,772 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:39,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:39,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:39,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:39,773 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:39,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:39,825 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 23:36:39,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:39,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:36:39,826 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:39,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:36:39,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:36:39,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:36:39,826 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 5 states. [2018-01-24 23:36:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:39,876 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-01-24 23:36:39,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:36:39,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 23:36:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:39,877 INFO L225 Difference]: With dead ends: 108 [2018-01-24 23:36:39,877 INFO L226 Difference]: Without dead ends: 88 [2018-01-24 23:36:39,877 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 23:36:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-24 23:36:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-01-24 23:36:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-24 23:36:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-24 23:36:39,881 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 33 [2018-01-24 23:36:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:39,881 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-24 23:36:39,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:36:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-24 23:36:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 23:36:39,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:39,882 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 23:36:39,883 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 23:36:39,883 INFO L82 PathProgramCache]: Analyzing trace with hash -486325487, now seen corresponding path program 1 times [2018-01-24 23:36:39,883 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:39,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:39,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:39,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:39,884 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:39,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:39,930 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 23:36:39,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:39,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:36:39,930 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:39,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:36:39,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:36:39,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:36:39,931 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 5 states. [2018-01-24 23:36:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:40,045 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-01-24 23:36:40,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:36:40,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 23:36:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:40,046 INFO L225 Difference]: With dead ends: 85 [2018-01-24 23:36:40,046 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 23:36:40,047 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 23:36:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 23:36:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-24 23:36:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 23:36:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-24 23:36:40,052 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 33 [2018-01-24 23:36:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:40,052 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-24 23:36:40,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:36:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-24 23:36:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 23:36:40,053 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:36:40,054 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 23:36:40,054 INFO L82 PathProgramCache]: Analyzing trace with hash -486325486, now seen corresponding path program 1 times [2018-01-24 23:36:40,054 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:40,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:40,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:40,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:40,055 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:40,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:40,304 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 23:36:40,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:40,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 23:36:40,305 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:40,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 23:36:40,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 23:36:40,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:36:40,306 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 11 states. [2018-01-24 23:36:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:40,573 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-01-24 23:36:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 23:36:40,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-24 23:36:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:40,574 INFO L225 Difference]: With dead ends: 87 [2018-01-24 23:36:40,574 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 23:36:40,575 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-01-24 23:36:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 23:36:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2018-01-24 23:36:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 23:36:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-01-24 23:36:40,578 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 33 [2018-01-24 23:36:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:40,579 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-01-24 23:36:40,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 23:36:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-01-24 23:36:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 23:36:40,580 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:40,580 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 23:36:40,580 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 23:36:40,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2103779100, now seen corresponding path program 1 times [2018-01-24 23:36:40,581 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:40,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:40,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:40,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:40,582 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:40,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:40,912 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 23:36:40,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:40,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 23:36:40,912 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:40,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 23:36:40,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 23:36:40,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:36:40,913 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 15 states. [2018-01-24 23:36:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:41,650 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-24 23:36:41,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 23:36:41,651 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 23:36:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:41,652 INFO L225 Difference]: With dead ends: 122 [2018-01-24 23:36:41,652 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 23:36:41,653 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-01-24 23:36:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 23:36:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2018-01-24 23:36:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 23:36:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-01-24 23:36:41,660 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 34 [2018-01-24 23:36:41,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:41,660 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-01-24 23:36:41,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 23:36:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-01-24 23:36:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 23:36:41,661 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:41,661 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 23:36:41,662 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 23:36:41,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2103779101, now seen corresponding path program 1 times [2018-01-24 23:36:41,662 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:41,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:41,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:41,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:41,663 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:41,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:42,015 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 23:36:42,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:42,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 23:36:42,015 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:42,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 23:36:42,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 23:36:42,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:36:42,016 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 15 states. [2018-01-24 23:36:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:42,489 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-01-24 23:36:42,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 23:36:42,489 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-24 23:36:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:42,490 INFO L225 Difference]: With dead ends: 111 [2018-01-24 23:36:42,490 INFO L226 Difference]: Without dead ends: 110 [2018-01-24 23:36:42,491 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-01-24 23:36:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-24 23:36:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2018-01-24 23:36:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 23:36:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-24 23:36:42,497 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 34 [2018-01-24 23:36:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:42,497 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-24 23:36:42,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 23:36:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-24 23:36:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 23:36:42,499 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:42,499 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 23:36:42,499 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 23:36:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash -950447499, now seen corresponding path program 1 times [2018-01-24 23:36:42,499 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:42,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:42,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:42,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:42,500 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:42,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:42,591 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 23:36:42,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:42,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:36:42,592 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:42,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:36:42,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:36:42,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:36:42,593 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 8 states. [2018-01-24 23:36:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:42,705 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-01-24 23:36:42,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 23:36:42,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-24 23:36:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:42,707 INFO L225 Difference]: With dead ends: 103 [2018-01-24 23:36:42,707 INFO L226 Difference]: Without dead ends: 95 [2018-01-24 23:36:42,707 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 23:36:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-24 23:36:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-24 23:36:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 23:36:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-01-24 23:36:42,713 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 35 [2018-01-24 23:36:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:42,713 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-01-24 23:36:42,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:36:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-01-24 23:36:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 23:36:42,714 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:42,715 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 23:36:42,715 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 23:36:42,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1197880803, now seen corresponding path program 1 times [2018-01-24 23:36:42,715 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:42,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:42,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:42,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:42,716 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:42,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:43,083 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 23:36:43,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:43,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 23:36:43,083 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:43,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 23:36:43,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 23:36:43,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:36:43,084 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 15 states. [2018-01-24 23:36:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:44,125 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2018-01-24 23:36:44,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 23:36:44,125 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-24 23:36:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:44,126 INFO L225 Difference]: With dead ends: 134 [2018-01-24 23:36:44,126 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 23:36:44,126 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2018-01-24 23:36:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 23:36:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 107. [2018-01-24 23:36:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 23:36:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-01-24 23:36:44,132 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 36 [2018-01-24 23:36:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:44,133 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-01-24 23:36:44,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 23:36:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-01-24 23:36:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 23:36:44,134 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:44,134 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 23:36:44,134 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 23:36:44,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1520400791, now seen corresponding path program 1 times [2018-01-24 23:36:44,134 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:44,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:44,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:44,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:44,135 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:44,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:44,212 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 23:36:44,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:44,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:36:44,213 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:44,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:36:44,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:36:44,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:36:44,213 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 8 states. [2018-01-24 23:36:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:44,367 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2018-01-24 23:36:44,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:36:44,367 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-24 23:36:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:44,369 INFO L225 Difference]: With dead ends: 107 [2018-01-24 23:36:44,369 INFO L226 Difference]: Without dead ends: 106 [2018-01-24 23:36:44,369 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 23:36:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-24 23:36:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-24 23:36:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-24 23:36:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-01-24 23:36:44,377 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 37 [2018-01-24 23:36:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:44,377 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-01-24 23:36:44,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:36:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-01-24 23:36:44,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 23:36:44,378 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:44,378 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 23:36:44,378 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 23:36:44,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1520400792, now seen corresponding path program 1 times [2018-01-24 23:36:44,378 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:44,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:44,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:44,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:44,380 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:44,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:44,772 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 22 DAG size of output 14 [2018-01-24 23:36:44,963 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 33 DAG size of output 27 [2018-01-24 23:36:45,121 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 23:36:45,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:36:45,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 23:36:45,121 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:36:45,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 23:36:45,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 23:36:45,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:36:45,122 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 15 states. [2018-01-24 23:36:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:36:45,583 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-24 23:36:45,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 23:36:45,584 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-01-24 23:36:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:36:45,584 INFO L225 Difference]: With dead ends: 117 [2018-01-24 23:36:45,584 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 23:36:45,585 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-01-24 23:36:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 23:36:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2018-01-24 23:36:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-24 23:36:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-01-24 23:36:45,590 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 37 [2018-01-24 23:36:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:36:45,590 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-01-24 23:36:45,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 23:36:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-01-24 23:36:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 23:36:45,590 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:36:45,590 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 23:36:45,591 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 23:36:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash -482433028, now seen corresponding path program 1 times [2018-01-24 23:36:45,591 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:36:45,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:45,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:36:45,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:36:45,592 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:36:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:36:45,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:36:45,761 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 23:36:45,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:36:45,761 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:36:45,762 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-24 23:36:45,764 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 23:36:45,809 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:36:45,809 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