java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:57:16,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:57:16,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:57:16,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:57:16,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:57:16,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:57:16,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:57:16,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:57:16,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:57:16,805 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:57:16,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:57:16,806 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:57:16,807 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:57:16,810 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:57:16,811 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:57:16,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:57:16,816 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:57:16,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:57:16,820 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:57:16,822 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:57:16,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:57:16,825 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:57:16,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:57:16,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:57:16,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:57:16,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:57:16,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:57:16,830 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:57:16,830 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:57:16,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:57:16,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:57:16,831 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:57:16,841 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:57:16,842 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:57:16,843 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:57:16,843 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:57:16,843 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:57:16,843 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:57:16,843 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:57:16,844 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:57:16,844 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:57:16,844 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:57:16,845 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:57:16,845 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:57:16,845 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:57:16,845 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:57:16,846 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:57:16,846 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:57:16,846 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:57:16,846 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:57:16,846 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:57:16,846 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:57:16,847 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:57:16,847 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:57:16,847 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:57:16,847 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:57:16,847 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:57:16,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:57:16,848 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:57:16,848 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:57:16,848 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:57:16,848 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:57:16,849 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:57:16,849 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:57:16,849 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:57:16,849 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:57:16,849 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:57:16,850 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:57:16,850 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:57:16,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:57:16,913 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:57:16,919 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:57:16,921 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:57:16,921 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:57:16,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i [2018-01-25 02:57:17,133 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:57:17,139 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:57:17,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:57:17,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:57:17,145 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:57:17,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:57:17" (1/1) ... [2018-01-25 02:57:17,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365d5287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:57:17, skipping insertion in model container [2018-01-25 02:57:17,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:57:17" (1/1) ... [2018-01-25 02:57:17,166 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:57:17,213 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:57:17,366 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:57:17,386 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:57:17,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:57:17 WrapperNode [2018-01-25 02:57:17,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:57:17,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:57:17,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:57:17,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:57:17,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:57:17" (1/1) ... [2018-01-25 02:57:17,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:57:17" (1/1) ... [2018-01-25 02:57:17,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:57:17" (1/1) ... [2018-01-25 02:57:17,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:57:17" (1/1) ... [2018-01-25 02:57:17,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:57:17" (1/1) ... [2018-01-25 02:57:17,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:57:17" (1/1) ... [2018-01-25 02:57:17,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:57:17" (1/1) ... [2018-01-25 02:57:17,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:57:17,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:57:17,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:57:17,454 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:57:17,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:57:17" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:57:18,604 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:57:18,604 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:57:18,604 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-25 02:57:18,604 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:57:18,604 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 02:57:18,604 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 02:57:18,604 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:57:18,604 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:57:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:57:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 02:57:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 02:57:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:57:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-25 02:57:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:57:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:57:18,605 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:57:18,970 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:57:18,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:57:18 BoogieIcfgContainer [2018-01-25 02:57:18,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:57:18,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:57:18,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:57:18,975 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:57:18,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:57:17" (1/3) ... [2018-01-25 02:57:18,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397e5467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:57:18, skipping insertion in model container [2018-01-25 02:57:18,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:57:17" (2/3) ... [2018-01-25 02:57:18,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397e5467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:57:18, skipping insertion in model container [2018-01-25 02:57:18,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:57:18" (3/3) ... [2018-01-25 02:57:18,980 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-01-25 02:57:18,990 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:57:18,999 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-01-25 02:57:19,043 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:57:19,043 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:57:19,044 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:57:19,044 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:57:19,044 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:57:19,044 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:57:19,044 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:57:19,044 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:57:19,045 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:57:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2018-01-25 02:57:19,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 02:57:19,076 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:19,077 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:57:19,077 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:19,081 INFO L82 PathProgramCache]: Analyzing trace with hash -758648706, now seen corresponding path program 1 times [2018-01-25 02:57:19,083 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:19,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:19,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:19,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:19,127 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:19,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:19,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:19,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 02:57:19,257 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:19,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:57:19,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:57:19,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:57:19,273 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 3 states. [2018-01-25 02:57:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:19,534 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2018-01-25 02:57:19,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:57:19,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 02:57:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:19,546 INFO L225 Difference]: With dead ends: 144 [2018-01-25 02:57:19,546 INFO L226 Difference]: Without dead ends: 89 [2018-01-25 02:57:19,549 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:57:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-25 02:57:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-01-25 02:57:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-25 02:57:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-01-25 02:57:19,594 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 7 [2018-01-25 02:57:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:19,595 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-01-25 02:57:19,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:57:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-01-25 02:57:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 02:57:19,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:19,595 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:57:19,595 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:19,596 INFO L82 PathProgramCache]: Analyzing trace with hash -758648705, now seen corresponding path program 1 times [2018-01-25 02:57:19,596 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:19,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:19,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:19,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:19,597 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:19,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:19,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:19,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 02:57:19,660 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:19,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:57:19,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:57:19,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:57:19,662 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 3 states. [2018-01-25 02:57:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:19,839 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-01-25 02:57:19,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:57:19,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 02:57:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:19,840 INFO L225 Difference]: With dead ends: 89 [2018-01-25 02:57:19,840 INFO L226 Difference]: Without dead ends: 88 [2018-01-25 02:57:19,841 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:57:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-25 02:57:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-01-25 02:57:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-25 02:57:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-01-25 02:57:19,848 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 7 [2018-01-25 02:57:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:19,848 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-01-25 02:57:19,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:57:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-01-25 02:57:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:57:19,849 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:19,849 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:57:19,849 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:19,849 INFO L82 PathProgramCache]: Analyzing trace with hash 689934579, now seen corresponding path program 1 times [2018-01-25 02:57:19,849 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:19,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:19,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:19,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:19,850 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:19,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:19,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:19,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:57:19,932 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:19,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:57:19,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:57:19,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:57:19,933 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 5 states. [2018-01-25 02:57:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:20,122 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-01-25 02:57:20,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:57:20,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-25 02:57:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:20,123 INFO L225 Difference]: With dead ends: 86 [2018-01-25 02:57:20,123 INFO L226 Difference]: Without dead ends: 83 [2018-01-25 02:57:20,124 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:57:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-25 02:57:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-25 02:57:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-25 02:57:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-01-25 02:57:20,132 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 13 [2018-01-25 02:57:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:20,132 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-01-25 02:57:20,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:57:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-01-25 02:57:20,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:57:20,133 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:20,133 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:57:20,134 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash 689934580, now seen corresponding path program 1 times [2018-01-25 02:57:20,134 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:20,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:20,136 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:20,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:20,136 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:20,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:20,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:20,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:57:20,286 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:20,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:57:20,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:57:20,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:57:20,287 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 7 states. [2018-01-25 02:57:20,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:20,501 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-01-25 02:57:20,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:57:20,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-01-25 02:57:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:20,503 INFO L225 Difference]: With dead ends: 83 [2018-01-25 02:57:20,503 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 02:57:20,503 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:57:20,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 02:57:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-25 02:57:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 02:57:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-01-25 02:57:20,511 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 13 [2018-01-25 02:57:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:20,511 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-01-25 02:57:20,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:57:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-01-25 02:57:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:57:20,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:20,512 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:57:20,512 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:20,512 INFO L82 PathProgramCache]: Analyzing trace with hash -86864468, now seen corresponding path program 1 times [2018-01-25 02:57:20,512 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:20,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:20,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:20,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:20,514 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:20,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:20,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:20,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:57:20,564 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:20,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:57:20,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:57:20,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:57:20,566 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 4 states. [2018-01-25 02:57:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:20,642 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-01-25 02:57:20,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:57:20,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:57:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:20,643 INFO L225 Difference]: With dead ends: 73 [2018-01-25 02:57:20,643 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 02:57:20,644 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:57:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 02:57:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-25 02:57:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-25 02:57:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-01-25 02:57:20,649 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 14 [2018-01-25 02:57:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:20,649 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-01-25 02:57:20,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:57:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-01-25 02:57:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:57:20,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:20,650 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:57:20,650 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash -86864467, now seen corresponding path program 1 times [2018-01-25 02:57:20,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:20,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:20,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:20,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:20,651 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:20,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:20,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:20,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:57:20,715 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:20,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:57:20,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:57:20,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:57:20,716 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 4 states. [2018-01-25 02:57:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:20,776 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-01-25 02:57:20,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:57:20,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:57:20,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:20,777 INFO L225 Difference]: With dead ends: 69 [2018-01-25 02:57:20,777 INFO L226 Difference]: Without dead ends: 65 [2018-01-25 02:57:20,777 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:57:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-25 02:57:20,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-25 02:57:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-25 02:57:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-01-25 02:57:20,783 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 14 [2018-01-25 02:57:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:20,783 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-01-25 02:57:20,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:57:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-01-25 02:57:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:57:20,784 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:20,784 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-25 02:57:20,784 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:20,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1124026018, now seen corresponding path program 1 times [2018-01-25 02:57:20,785 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:20,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:20,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:20,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:20,786 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:20,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:20,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:20,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:57:20,870 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:20,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:57:20,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:57:20,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:57:20,871 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 8 states. [2018-01-25 02:57:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:21,062 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2018-01-25 02:57:21,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 02:57:21,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 02:57:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:21,063 INFO L225 Difference]: With dead ends: 138 [2018-01-25 02:57:21,064 INFO L226 Difference]: Without dead ends: 80 [2018-01-25 02:57:21,064 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-25 02:57:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-25 02:57:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-01-25 02:57:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 02:57:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-25 02:57:21,073 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 19 [2018-01-25 02:57:21,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:21,073 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-25 02:57:21,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:57:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-25 02:57:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 02:57:21,075 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:21,076 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-25 02:57:21,076 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:21,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1338134626, now seen corresponding path program 1 times [2018-01-25 02:57:21,076 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:21,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:21,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:21,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:21,078 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:21,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:21,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:21,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:57:21,196 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:21,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:57:21,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:57:21,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:57:21,197 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 7 states. [2018-01-25 02:57:21,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:21,401 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-01-25 02:57:21,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:57:21,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 02:57:21,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:21,402 INFO L225 Difference]: With dead ends: 89 [2018-01-25 02:57:21,402 INFO L226 Difference]: Without dead ends: 88 [2018-01-25 02:57:21,402 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:57:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-25 02:57:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2018-01-25 02:57:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 02:57:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-25 02:57:21,407 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 30 [2018-01-25 02:57:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:21,408 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-25 02:57:21,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:57:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-25 02:57:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 02:57:21,408 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:21,409 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-25 02:57:21,409 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1338134627, now seen corresponding path program 1 times [2018-01-25 02:57:21,409 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:21,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:21,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:21,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:21,410 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:21,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:21,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:21,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:57:21,601 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:21,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:57:21,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:57:21,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:57:21,603 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 9 states. [2018-01-25 02:57:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:21,833 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-01-25 02:57:21,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 02:57:21,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-25 02:57:21,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:21,834 INFO L225 Difference]: With dead ends: 92 [2018-01-25 02:57:21,834 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 02:57:21,835 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-25 02:57:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 02:57:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 73. [2018-01-25 02:57:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 02:57:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-01-25 02:57:21,841 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 30 [2018-01-25 02:57:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:21,842 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-01-25 02:57:21,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:57:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-01-25 02:57:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:57:21,843 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:21,843 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:57:21,843 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:21,844 INFO L82 PathProgramCache]: Analyzing trace with hash -952870546, now seen corresponding path program 1 times [2018-01-25 02:57:21,844 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:21,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:21,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:21,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:21,845 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:21,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:21,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:21,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:57:21,911 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:21,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:57:21,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:57:21,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:57:21,912 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2018-01-25 02:57:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:21,967 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-01-25 02:57:21,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:57:21,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-25 02:57:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:21,968 INFO L225 Difference]: With dead ends: 99 [2018-01-25 02:57:21,968 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 02:57:21,969 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-25 02:57:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 02:57:21,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-01-25 02:57:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-25 02:57:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-25 02:57:21,974 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 33 [2018-01-25 02:57:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:21,974 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-25 02:57:21,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:57:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-25 02:57:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:57:21,975 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:21,975 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:57:21,975 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1517792313, now seen corresponding path program 1 times [2018-01-25 02:57:21,975 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:21,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:21,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:21,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:21,976 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:21,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:22,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:22,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:57:22,229 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:22,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:57:22,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:57:22,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:57:22,230 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 8 states. [2018-01-25 02:57:22,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:22,375 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-01-25 02:57:22,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:57:22,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-01-25 02:57:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:22,376 INFO L225 Difference]: With dead ends: 79 [2018-01-25 02:57:22,376 INFO L226 Difference]: Without dead ends: 78 [2018-01-25 02:57:22,376 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:57:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-25 02:57:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2018-01-25 02:57:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 02:57:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-25 02:57:22,382 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 33 [2018-01-25 02:57:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:22,383 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-25 02:57:22,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:57:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-25 02:57:22,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:57:22,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:22,384 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:57:22,385 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:22,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1517792312, now seen corresponding path program 1 times [2018-01-25 02:57:22,385 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:22,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:22,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:22,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:22,386 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:22,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:22,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:22,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:57:22,444 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:22,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:57:22,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:57:22,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:57:22,445 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 5 states. [2018-01-25 02:57:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:22,589 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-25 02:57:22,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:57:22,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-25 02:57:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:22,590 INFO L225 Difference]: With dead ends: 75 [2018-01-25 02:57:22,590 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 02:57:22,591 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:57:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 02:57:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-25 02:57:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 02:57:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-25 02:57:22,596 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 33 [2018-01-25 02:57:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:22,596 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-25 02:57:22,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:57:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-25 02:57:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 02:57:22,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:22,598 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:57:22,598 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:22,598 INFO L82 PathProgramCache]: Analyzing trace with hash -881792853, now seen corresponding path program 1 times [2018-01-25 02:57:22,599 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:22,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:22,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:22,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:22,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:22,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:22,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:22,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:57:22,702 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:22,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:57:22,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:57:22,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:57:22,703 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 8 states. [2018-01-25 02:57:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:22,811 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-01-25 02:57:22,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 02:57:22,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-25 02:57:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:22,812 INFO L225 Difference]: With dead ends: 79 [2018-01-25 02:57:22,812 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 02:57:22,813 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-25 02:57:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 02:57:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-25 02:57:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 02:57:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-01-25 02:57:22,817 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 35 [2018-01-25 02:57:22,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:22,817 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-01-25 02:57:22,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:57:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-01-25 02:57:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 02:57:22,818 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:22,818 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:57:22,819 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:22,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1690468264, now seen corresponding path program 1 times [2018-01-25 02:57:22,819 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:22,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:22,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:22,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:22,820 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:22,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:23,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:57:23,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 02:57:23,060 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:57:23,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 02:57:23,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 02:57:23,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:57:23,061 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 12 states. [2018-01-25 02:57:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:57:23,287 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-01-25 02:57:23,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 02:57:23,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-01-25 02:57:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:57:23,288 INFO L225 Difference]: With dead ends: 71 [2018-01-25 02:57:23,288 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 02:57:23,289 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-25 02:57:23,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 02:57:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-25 02:57:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 02:57:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-01-25 02:57:23,296 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 35 [2018-01-25 02:57:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:57:23,297 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-01-25 02:57:23,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 02:57:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-01-25 02:57:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 02:57:23,298 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:57:23,299 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-25 02:57:23,299 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:57:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash 403683132, now seen corresponding path program 1 times [2018-01-25 02:57:23,299 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:57:23,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:23,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:57:23,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:57:23,300 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:57:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:57:23,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:57:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:57:23,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:57:23,498 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:57:23,498 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-25 02:57:23,500 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [12], [15], [20], [87], [88], [89], [90], [93], [96], [97], [102], [103], [107], [111], [112], [113], [115], [118], [119], [122], [123], [124], [125], [127], [128] [2018-01-25 02:57:23,548 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:57:23,548 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