java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:32:08,939 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:32:08,940 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:32:08,954 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:32:08,955 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:32:08,955 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:32:08,956 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:32:08,958 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:32:08,960 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:32:08,961 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:32:08,962 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:32:08,962 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:32:08,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:32:08,964 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:32:08,964 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:32:08,967 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:32:08,969 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:32:08,971 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:32:08,972 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:32:08,973 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:32:08,975 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:32:08,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:32:08,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:32:08,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:32:08,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:32:08,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:32:08,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:32:08,980 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:32:08,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:32:08,980 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:32:08,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:32:08,981 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-24 23:32:08,991 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:32:08,991 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:32:08,992 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:32:08,992 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:32:08,992 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:32:08,993 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:32:08,993 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:32:08,993 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:32:08,994 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:32:08,994 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:32:08,994 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:32:08,994 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:32:08,994 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:32:08,995 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:32:08,995 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:32:08,995 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:32:08,995 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:32:08,995 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:32:08,996 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:32:08,996 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:32:08,996 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:32:08,996 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:32:08,996 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:32:08,997 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:32:08,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:32:08,997 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:32:08,997 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:32:08,997 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:32:08,998 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:32:08,998 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:32:08,998 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:32:08,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:32:08,998 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:32:08,999 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:32:08,999 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:32:09,000 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:32:09,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:32:09,045 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:32:09,049 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:32:09,051 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:32:09,051 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:32:09,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i [2018-01-24 23:32:09,234 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:32:09,240 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:32:09,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:32:09,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:32:09,245 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:32:09,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:32:09" (1/1) ... [2018-01-24 23:32:09,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3ee212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:32:09, skipping insertion in model container [2018-01-24 23:32:09,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:32:09" (1/1) ... [2018-01-24 23:32:09,266 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:32:09,307 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:32:09,428 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:32:09,452 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:32:09,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:32:09 WrapperNode [2018-01-24 23:32:09,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:32:09,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:32:09,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:32:09,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:32:09,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:32:09" (1/1) ... [2018-01-24 23:32:09,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:32:09" (1/1) ... [2018-01-24 23:32:09,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:32:09" (1/1) ... [2018-01-24 23:32:09,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:32:09" (1/1) ... [2018-01-24 23:32:09,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:32:09" (1/1) ... [2018-01-24 23:32:09,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:32:09" (1/1) ... [2018-01-24 23:32:09,496 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:32:09" (1/1) ... [2018-01-24 23:32:09,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:32:09,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:32:09,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:32:09,500 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:32:09,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:32:09" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:32:09,561 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:32:09,562 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:32:09,562 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-24 23:32:09,562 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-24 23:32:09,562 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-24 23:32:09,562 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-24 23:32:09,562 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-24 23:32:09,562 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-24 23:32:09,562 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-24 23:32:09,562 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-24 23:32:09,562 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:32:09,563 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 23:32:09,563 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 23:32:09,563 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:32:09,563 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:32:09,563 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:32:09,563 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:32:09,563 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:32:09,563 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 23:32:09,563 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 23:32:09,563 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:32:09,564 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-24 23:32:09,564 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-24 23:32:09,564 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-24 23:32:09,564 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-24 23:32:09,564 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-24 23:32:09,564 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-24 23:32:09,564 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-24 23:32:09,564 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-24 23:32:09,564 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:32:09,565 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:32:09,565 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:32:10,022 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:32:10,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:32:10 BoogieIcfgContainer [2018-01-24 23:32:10,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:32:10,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:32:10,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:32:10,026 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:32:10,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:32:09" (1/3) ... [2018-01-24 23:32:10,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531f915b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:32:10, skipping insertion in model container [2018-01-24 23:32:10,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:32:09" (2/3) ... [2018-01-24 23:32:10,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@531f915b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:32:10, skipping insertion in model container [2018-01-24 23:32:10,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:32:10" (3/3) ... [2018-01-24 23:32:10,029 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_false-valid-memtrack.i [2018-01-24 23:32:10,035 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:32:10,042 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-01-24 23:32:10,086 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:32:10,087 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:32:10,087 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:32:10,087 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:32:10,087 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:32:10,087 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:32:10,087 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:32:10,087 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:32:10,088 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:32:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-01-24 23:32:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 23:32:10,111 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:10,112 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:10,112 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash -475500327, now seen corresponding path program 1 times [2018-01-24 23:32:10,119 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:10,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:10,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:10,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:10,159 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:10,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:10,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:10,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:32:10,275 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:10,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:32:10,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:32:10,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:32:10,298 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2018-01-24 23:32:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:10,480 INFO L93 Difference]: Finished difference Result 224 states and 252 transitions. [2018-01-24 23:32:10,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:32:10,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 23:32:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:10,490 INFO L225 Difference]: With dead ends: 224 [2018-01-24 23:32:10,490 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 23:32:10,494 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:32:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 23:32:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-24 23:32:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 23:32:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-24 23:32:10,534 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 7 [2018-01-24 23:32:10,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:10,534 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-24 23:32:10,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:32:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-24 23:32:10,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 23:32:10,535 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:10,535 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:10,535 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:10,536 INFO L82 PathProgramCache]: Analyzing trace with hash -475500326, now seen corresponding path program 1 times [2018-01-24 23:32:10,536 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:10,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:10,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:10,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:10,538 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:10,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:10,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:10,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 23:32:10,597 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:10,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:32:10,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:32:10,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:32:10,600 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 3 states. [2018-01-24 23:32:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:10,733 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-24 23:32:10,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:32:10,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 23:32:10,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:10,738 INFO L225 Difference]: With dead ends: 114 [2018-01-24 23:32:10,738 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 23:32:10,740 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:32:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 23:32:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-24 23:32:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 23:32:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-24 23:32:10,752 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 7 [2018-01-24 23:32:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:10,752 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-24 23:32:10,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:32:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-24 23:32:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:32:10,753 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:10,753 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:10,753 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:10,753 INFO L82 PathProgramCache]: Analyzing trace with hash 644933486, now seen corresponding path program 1 times [2018-01-24 23:32:10,754 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:10,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:10,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:10,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:10,755 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:10,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:10,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:10,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:32:10,838 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:10,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:32:10,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:32:10,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:32:10,840 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 6 states. [2018-01-24 23:32:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:11,103 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-24 23:32:11,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 23:32:11,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 23:32:11,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:11,107 INFO L225 Difference]: With dead ends: 122 [2018-01-24 23:32:11,107 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 23:32:11,107 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:32:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 23:32:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-01-24 23:32:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 23:32:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-24 23:32:11,121 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 19 [2018-01-24 23:32:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:11,121 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-24 23:32:11,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:32:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-24 23:32:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:32:11,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:11,122 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:11,122 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:11,123 INFO L82 PathProgramCache]: Analyzing trace with hash 644933487, now seen corresponding path program 1 times [2018-01-24 23:32:11,123 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:11,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:11,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:11,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:11,124 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:11,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:11,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:11,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:32:11,318 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:11,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:32:11,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:32:11,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:32:11,319 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 6 states. [2018-01-24 23:32:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:11,449 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-01-24 23:32:11,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:32:11,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 23:32:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:11,450 INFO L225 Difference]: With dead ends: 118 [2018-01-24 23:32:11,450 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 23:32:11,451 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:32:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 23:32:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-01-24 23:32:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 23:32:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-24 23:32:11,459 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 19 [2018-01-24 23:32:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:11,459 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-24 23:32:11,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:32:11,460 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-24 23:32:11,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 23:32:11,460 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:11,460 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] [2018-01-24 23:32:11,460 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:11,461 INFO L82 PathProgramCache]: Analyzing trace with hash 264154241, now seen corresponding path program 1 times [2018-01-24 23:32:11,461 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:11,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:11,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:11,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:11,462 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:11,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:11,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:11,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:32:11,526 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:11,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:32:11,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:32:11,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:32:11,527 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 4 states. [2018-01-24 23:32:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:11,642 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-24 23:32:11,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:32:11,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 23:32:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:11,643 INFO L225 Difference]: With dead ends: 114 [2018-01-24 23:32:11,643 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 23:32:11,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-24 23:32:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 23:32:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-24 23:32:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 23:32:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-24 23:32:11,655 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 27 [2018-01-24 23:32:11,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:11,656 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-24 23:32:11,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:32:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-24 23:32:11,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 23:32:11,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:11,657 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] [2018-01-24 23:32:11,658 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:11,658 INFO L82 PathProgramCache]: Analyzing trace with hash 264154242, now seen corresponding path program 1 times [2018-01-24 23:32:11,658 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:11,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:11,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:11,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:11,659 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:11,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:11,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:11,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:32:11,767 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:11,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:32:11,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:32:11,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:32:11,768 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-01-24 23:32:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:11,833 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-01-24 23:32:11,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:32:11,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 23:32:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:11,834 INFO L225 Difference]: With dead ends: 113 [2018-01-24 23:32:11,834 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 23:32:11,835 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:32:11,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 23:32:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-24 23:32:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 23:32:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-24 23:32:11,844 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 27 [2018-01-24 23:32:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:11,844 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-24 23:32:11,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:32:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-24 23:32:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 23:32:11,845 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:11,846 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:11,846 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036196, now seen corresponding path program 1 times [2018-01-24 23:32:11,846 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:11,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:11,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:11,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:11,847 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:11,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:12,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:12,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:32:12,027 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:12,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:32:12,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:32:12,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:32:12,028 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 9 states. [2018-01-24 23:32:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:12,290 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-24 23:32:12,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 23:32:12,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-24 23:32:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:12,291 INFO L225 Difference]: With dead ends: 120 [2018-01-24 23:32:12,292 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 23:32:12,292 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:32:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 23:32:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-01-24 23:32:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 23:32:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-24 23:32:12,298 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 30 [2018-01-24 23:32:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:12,298 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-24 23:32:12,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:32:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-24 23:32:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 23:32:12,299 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:12,300 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:12,300 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:12,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036197, now seen corresponding path program 1 times [2018-01-24 23:32:12,300 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:12,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:12,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:12,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:12,301 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:12,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:12,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:12,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 23:32:12,600 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:12,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 23:32:12,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 23:32:12,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:32:12,601 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 11 states. [2018-01-24 23:32:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:13,004 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-01-24 23:32:13,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 23:32:13,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 23:32:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:13,005 INFO L225 Difference]: With dead ends: 141 [2018-01-24 23:32:13,005 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 23:32:13,006 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-01-24 23:32:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 23:32:13,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-01-24 23:32:13,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 23:32:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-01-24 23:32:13,014 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 30 [2018-01-24 23:32:13,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:13,014 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-01-24 23:32:13,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 23:32:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-01-24 23:32:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 23:32:13,015 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:13,015 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:13,015 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:13,016 INFO L82 PathProgramCache]: Analyzing trace with hash 98146345, now seen corresponding path program 1 times [2018-01-24 23:32:13,016 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:13,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:13,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:13,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:13,017 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:13,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:13,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:13,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:32:13,113 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:13,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:32:13,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:32:13,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:32:13,113 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 5 states. [2018-01-24 23:32:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:13,281 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-01-24 23:32:13,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:32:13,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 23:32:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:13,282 INFO L225 Difference]: With dead ends: 138 [2018-01-24 23:32:13,282 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 23:32:13,283 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:32:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 23:32:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-24 23:32:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 23:32:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-01-24 23:32:13,290 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 33 [2018-01-24 23:32:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:13,290 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-01-24 23:32:13,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:32:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-01-24 23:32:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 23:32:13,291 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:13,291 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:13,291 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:13,291 INFO L82 PathProgramCache]: Analyzing trace with hash 98146346, now seen corresponding path program 1 times [2018-01-24 23:32:13,291 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:13,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:13,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:13,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:13,292 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:13,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:13,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:13,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 23:32:13,436 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:13,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 23:32:13,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 23:32:13,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-24 23:32:13,438 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 13 states. [2018-01-24 23:32:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:13,716 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2018-01-24 23:32:13,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 23:32:13,720 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-24 23:32:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:13,722 INFO L225 Difference]: With dead ends: 152 [2018-01-24 23:32:13,722 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 23:32:13,722 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-01-24 23:32:13,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 23:32:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2018-01-24 23:32:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 23:32:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-01-24 23:32:13,732 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 33 [2018-01-24 23:32:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:13,733 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-01-24 23:32:13,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 23:32:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-01-24 23:32:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 23:32:13,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:13,734 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:13,734 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:13,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430627, now seen corresponding path program 1 times [2018-01-24 23:32:13,735 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:13,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:13,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:13,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:13,736 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:13,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:13,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:13,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:32:13,813 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:13,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:32:13,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:32:13,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:32:13,814 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 7 states. [2018-01-24 23:32:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:13,996 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-01-24 23:32:13,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 23:32:13,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-24 23:32:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:13,998 INFO L225 Difference]: With dead ends: 150 [2018-01-24 23:32:13,998 INFO L226 Difference]: Without dead ends: 148 [2018-01-24 23:32:13,999 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:32:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-24 23:32:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-01-24 23:32:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 23:32:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-01-24 23:32:14,011 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 34 [2018-01-24 23:32:14,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:14,011 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-01-24 23:32:14,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:32:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-01-24 23:32:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 23:32:14,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:14,012 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:14,013 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430626, now seen corresponding path program 1 times [2018-01-24 23:32:14,013 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:14,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:14,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:14,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:14,014 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:14,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:14,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:14,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:32:14,227 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:14,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:32:14,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:32:14,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:32:14,228 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 8 states. [2018-01-24 23:32:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:14,486 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-01-24 23:32:14,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 23:32:14,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-24 23:32:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:14,487 INFO L225 Difference]: With dead ends: 148 [2018-01-24 23:32:14,487 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 23:32:14,488 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:32:14,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 23:32:14,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-01-24 23:32:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 23:32:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-01-24 23:32:14,498 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 34 [2018-01-24 23:32:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:14,499 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-01-24 23:32:14,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:32:14,499 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-01-24 23:32:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 23:32:14,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:14,500 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:14,500 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:14,500 INFO L82 PathProgramCache]: Analyzing trace with hash -994990400, now seen corresponding path program 1 times [2018-01-24 23:32:14,500 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:14,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:14,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:14,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:14,501 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:14,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:14,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:14,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 23:32:14,822 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:14,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 23:32:14,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 23:32:14,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 23:32:14,823 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 17 states. [2018-01-24 23:32:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:15,301 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2018-01-24 23:32:15,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 23:32:15,302 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-24 23:32:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:15,303 INFO L225 Difference]: With dead ends: 177 [2018-01-24 23:32:15,303 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 23:32:15,304 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-01-24 23:32:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 23:32:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-01-24 23:32:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-24 23:32:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2018-01-24 23:32:15,316 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 36 [2018-01-24 23:32:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:15,317 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2018-01-24 23:32:15,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 23:32:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2018-01-24 23:32:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 23:32:15,318 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:15,318 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:15,318 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:15,318 INFO L82 PathProgramCache]: Analyzing trace with hash -994990399, now seen corresponding path program 1 times [2018-01-24 23:32:15,318 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:15,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:15,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:15,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:15,320 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:15,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:15,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:32:15,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 23:32:15,747 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:32:15,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 23:32:15,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 23:32:15,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 23:32:15,748 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand 17 states. [2018-01-24 23:32:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:32:16,474 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2018-01-24 23:32:16,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 23:32:16,474 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-24 23:32:16,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:32:16,475 INFO L225 Difference]: With dead ends: 181 [2018-01-24 23:32:16,476 INFO L226 Difference]: Without dead ends: 180 [2018-01-24 23:32:16,476 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2018-01-24 23:32:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-24 23:32:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-01-24 23:32:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-24 23:32:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-01-24 23:32:16,489 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 36 [2018-01-24 23:32:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:32:16,489 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-01-24 23:32:16,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 23:32:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-01-24 23:32:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 23:32:16,490 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:32:16,491 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:32:16,491 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, insert_subErr0RequiresViolation, insert_subErr1RequiresViolation, destroy_subErr2RequiresViolation, destroy_subErr3RequiresViolation, destroy_subErr4RequiresViolation, destroy_subErr5RequiresViolation, destroy_subErr1RequiresViolation, destroy_subErr0RequiresViolation, create_sub_listErr1RequiresViolation, create_sub_listErr2RequiresViolation, create_sub_listErr0RequiresViolation, create_sub_listErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, list_add_tailErr0RequiresViolation, list_add_tailErr1RequiresViolation, destroy_topErr1RequiresViolation, destroy_topErr3RequiresViolation, destroy_topErr2RequiresViolation, destroy_topErr0RequiresViolation, destroy_topErr4RequiresViolation, destroy_topErr5RequiresViolation]=== [2018-01-24 23:32:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash -315835362, now seen corresponding path program 1 times [2018-01-24 23:32:16,491 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:32:16,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:16,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:32:16,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:32:16,492 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:32:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:32:16,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:32:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:32:16,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:32:16,601 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:32:16,601 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-24 23:32:16,603 INFO L201 CegarAbsIntRunner]: [0], [1], [4], [7], [10], [13], [14], [15], [16], [21], [23], [27], [55], [56], [57], [59], [65], [68], [71], [77], [78], [79], [82], [92], [93], [97], [98], [127], [128], [129], [133], [146], [147], [148], [153], [162], [163], [164], [165], [166], [170], [171], [174], [176], [177], [178], [182], [183], [184] [2018-01-24 23:32:16,645 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:32:16,645 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