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_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:58:45,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:58:45,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:58:45,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:58:45,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:58:45,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:58:45,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:58:45,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:58:45,591 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:58:45,592 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:58:45,593 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:58:45,593 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:58:45,594 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:58:45,596 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:58:45,596 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:58:45,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:58:45,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:58:45,602 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:58:45,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:58:45,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:58:45,606 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:58:45,607 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:58:45,607 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:58:45,608 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:58:45,608 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:58:45,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:58:45,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:58:45,610 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:58:45,610 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:58:45,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:58:45,611 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:58:45,612 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_imprecise.epf [2018-01-24 16:58:45,620 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:58:45,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:58:45,621 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:58:45,622 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:58:45,622 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:58:45,622 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:58:45,622 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:58:45,622 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:58:45,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:58:45,623 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:58:45,623 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:58:45,623 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:58:45,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:58:45,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:58:45,624 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:58:45,624 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:58:45,624 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:58:45,624 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:58:45,625 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:58:45,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:58:45,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:58:45,625 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:58:45,625 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:58:45,626 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:58:45,626 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:58:45,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:58:45,626 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:58:45,626 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:58:45,627 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:58:45,627 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:58:45,627 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:58:45,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:58:45,627 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:58:45,627 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:58:45,628 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:58:45,628 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:58:45,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:58:45,672 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:58:45,675 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:58:45,677 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:58:45,677 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:58:45,678 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 16:58:45,858 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:58:45,864 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:58:45,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:58:45,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:58:45,869 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:58:45,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:58:45" (1/1) ... [2018-01-24 16:58:45,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ea857c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:58:45, skipping insertion in model container [2018-01-24 16:58:45,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:58:45" (1/1) ... [2018-01-24 16:58:45,890 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:58:45,932 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:58:46,048 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:58:46,069 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:58:46,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:58:46 WrapperNode [2018-01-24 16:58:46,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:58:46,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:58:46,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:58:46,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:58:46,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:58:46" (1/1) ... [2018-01-24 16:58:46,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:58:46" (1/1) ... [2018-01-24 16:58:46,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:58:46" (1/1) ... [2018-01-24 16:58:46,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:58:46" (1/1) ... [2018-01-24 16:58:46,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:58:46" (1/1) ... [2018-01-24 16:58:46,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:58:46" (1/1) ... [2018-01-24 16:58:46,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:58:46" (1/1) ... [2018-01-24 16:58:46,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:58:46,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:58:46,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:58:46,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:58:46,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:58:46" (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 16:58:46,174 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:58:46,174 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:58:46,174 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-24 16:58:46,174 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-24 16:58:46,175 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-24 16:58:46,175 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-24 16:58:46,175 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-24 16:58:46,175 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-24 16:58:46,175 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-24 16:58:46,175 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-24 16:58:46,175 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:58:46,175 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:58:46,175 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:58:46,175 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 16:58:46,176 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 16:58:46,176 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:58:46,176 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:58:46,176 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:58:46,176 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 16:58:46,176 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 16:58:46,176 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:58:46,176 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-24 16:58:46,176 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-24 16:58:46,176 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-24 16:58:46,177 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-24 16:58:46,177 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-24 16:58:46,177 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-24 16:58:46,177 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-24 16:58:46,177 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-24 16:58:46,177 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:58:46,177 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:58:46,177 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:58:46,598 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:58:46,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:58:46 BoogieIcfgContainer [2018-01-24 16:58:46,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:58:46,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:58:46,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:58:46,602 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:58:46,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:58:45" (1/3) ... [2018-01-24 16:58:46,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522e3fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:58:46, skipping insertion in model container [2018-01-24 16:58:46,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:58:46" (2/3) ... [2018-01-24 16:58:46,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522e3fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:58:46, skipping insertion in model container [2018-01-24 16:58:46,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:58:46" (3/3) ... [2018-01-24 16:58:46,605 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_false-valid-memtrack.i [2018-01-24 16:58:46,612 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:58:46,619 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-01-24 16:58:46,671 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:58:46,671 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:58:46,671 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:58:46,672 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:58:46,672 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:58:46,672 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:58:46,672 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:58:46,672 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:58:46,673 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:58:46,697 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-01-24 16:58:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 16:58:46,704 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:46,705 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:58:46,705 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 16:58:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash -475500327, now seen corresponding path program 1 times [2018-01-24 16:58:46,713 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:46,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:46,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:46,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:46,762 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:46,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:46,896 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 16:58:46,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:46,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:58:46,899 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:46,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:58:46,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:58:46,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:58:46,919 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2018-01-24 16:58:47,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:47,150 INFO L93 Difference]: Finished difference Result 224 states and 252 transitions. [2018-01-24 16:58:47,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:58:47,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 16:58:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:47,161 INFO L225 Difference]: With dead ends: 224 [2018-01-24 16:58:47,161 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 16:58:47,166 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 16:58:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 16:58:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-24 16:58:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 16:58:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-24 16:58:47,218 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 7 [2018-01-24 16:58:47,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:47,219 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-24 16:58:47,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:58:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-24 16:58:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 16:58:47,220 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:47,220 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:58:47,220 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 16:58:47,220 INFO L82 PathProgramCache]: Analyzing trace with hash -475500326, now seen corresponding path program 1 times [2018-01-24 16:58:47,220 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:47,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:47,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:47,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:47,222 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:47,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:47,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 16:58:47,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:47,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:58:47,284 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:47,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:58:47,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:58:47,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:58:47,286 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 3 states. [2018-01-24 16:58:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:47,384 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-24 16:58:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:58:47,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 16:58:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:47,386 INFO L225 Difference]: With dead ends: 114 [2018-01-24 16:58:47,386 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 16:58:47,387 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 16:58:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 16:58:47,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-24 16:58:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 16:58:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-24 16:58:47,397 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 7 [2018-01-24 16:58:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:47,397 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-24 16:58:47,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:58:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-24 16:58:47,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:58:47,397 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:47,398 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 16:58:47,398 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 16:58:47,398 INFO L82 PathProgramCache]: Analyzing trace with hash 644933486, now seen corresponding path program 1 times [2018-01-24 16:58:47,398 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:47,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:47,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:47,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:47,399 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:47,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:47,501 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 16:58:47,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:47,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:58:47,502 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:47,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:58:47,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:58:47,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:58:47,503 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 6 states. [2018-01-24 16:58:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:47,769 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-24 16:58:47,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:58:47,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 16:58:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:47,774 INFO L225 Difference]: With dead ends: 122 [2018-01-24 16:58:47,775 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 16:58:47,775 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 16:58:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 16:58:47,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-01-24 16:58:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 16:58:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-24 16:58:47,790 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 19 [2018-01-24 16:58:47,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:47,790 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-24 16:58:47,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:58:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-24 16:58:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 16:58:47,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:47,791 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 16:58:47,792 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 16:58:47,792 INFO L82 PathProgramCache]: Analyzing trace with hash 644933487, now seen corresponding path program 1 times [2018-01-24 16:58:47,792 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:47,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:47,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:47,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:47,793 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:47,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:47,964 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 16:58:47,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:47,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:58:47,964 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:47,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:58:47,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:58:47,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:58:47,965 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 6 states. [2018-01-24 16:58:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:48,104 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-01-24 16:58:48,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:58:48,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 16:58:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:48,106 INFO L225 Difference]: With dead ends: 118 [2018-01-24 16:58:48,106 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 16:58:48,107 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 16:58:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 16:58:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-01-24 16:58:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 16:58:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-24 16:58:48,119 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 19 [2018-01-24 16:58:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:48,119 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-24 16:58:48,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:58:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-24 16:58:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:58:48,120 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:48,121 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:58:48,121 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 16:58:48,121 INFO L82 PathProgramCache]: Analyzing trace with hash 264154241, now seen corresponding path program 1 times [2018-01-24 16:58:48,121 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:48,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:48,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:48,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:48,122 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:48,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:48,206 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 16:58:48,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:48,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:58:48,206 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:48,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:58:48,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:58:48,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:58:48,207 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 4 states. [2018-01-24 16:58:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:48,309 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-24 16:58:48,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:58:48,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 16:58:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:48,311 INFO L225 Difference]: With dead ends: 114 [2018-01-24 16:58:48,311 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 16:58:48,312 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 16:58:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 16:58:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-24 16:58:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 16:58:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-24 16:58:48,325 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 27 [2018-01-24 16:58:48,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:48,325 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-24 16:58:48,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:58:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-24 16:58:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:58:48,326 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:48,326 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 16:58:48,327 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 16:58:48,327 INFO L82 PathProgramCache]: Analyzing trace with hash 264154242, now seen corresponding path program 1 times [2018-01-24 16:58:48,327 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:48,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:48,328 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:48,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:48,328 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:48,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:48,428 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 16:58:48,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:48,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:58:48,429 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:48,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:58:48,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:58:48,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:58:48,430 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-01-24 16:58:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:48,498 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-01-24 16:58:48,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:58:48,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 16:58:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:48,500 INFO L225 Difference]: With dead ends: 113 [2018-01-24 16:58:48,500 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 16:58:48,500 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 16:58:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 16:58:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-24 16:58:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 16:58:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-24 16:58:48,509 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 27 [2018-01-24 16:58:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:48,510 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-24 16:58:48,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:58:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-24 16:58:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:58:48,511 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:48,511 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 16:58:48,511 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 16:58:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036196, now seen corresponding path program 1 times [2018-01-24 16:58:48,512 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:48,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:48,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:48,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:48,513 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:48,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:48,694 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 16:58:48,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:48,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:58:48,694 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:48,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:58:48,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:58:48,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:58:48,695 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 9 states. [2018-01-24 16:58:48,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:48,941 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-24 16:58:48,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:58:48,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-24 16:58:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:48,942 INFO L225 Difference]: With dead ends: 120 [2018-01-24 16:58:48,942 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 16:58:48,942 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 16:58:48,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 16:58:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-01-24 16:58:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-24 16:58:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-24 16:58:48,950 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 30 [2018-01-24 16:58:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:48,951 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-24 16:58:48,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:58:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-24 16:58:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:58:48,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:48,952 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 16:58:48,952 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 16:58:48,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036197, now seen corresponding path program 1 times [2018-01-24 16:58:48,952 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:48,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:48,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:48,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:48,953 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:48,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:49,234 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 16:58:49,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:49,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 16:58:49,235 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:49,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:58:49,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:58:49,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:58:49,236 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 11 states. [2018-01-24 16:58:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:49,602 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-01-24 16:58:49,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:58:49,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 16:58:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:49,603 INFO L225 Difference]: With dead ends: 141 [2018-01-24 16:58:49,604 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 16:58:49,604 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 16:58:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 16:58:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-01-24 16:58:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 16:58:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-01-24 16:58:49,613 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 30 [2018-01-24 16:58:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:49,613 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-01-24 16:58:49,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:58:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-01-24 16:58:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:58:49,614 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:49,614 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 16:58:49,614 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 16:58:49,614 INFO L82 PathProgramCache]: Analyzing trace with hash 98146345, now seen corresponding path program 1 times [2018-01-24 16:58:49,615 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:49,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:49,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:49,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:49,616 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:49,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:49,700 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 16:58:49,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:49,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:58:49,700 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:49,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:58:49,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:58:49,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:58:49,701 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 5 states. [2018-01-24 16:58:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:49,830 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-01-24 16:58:49,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:58:49,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-24 16:58:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:49,832 INFO L225 Difference]: With dead ends: 138 [2018-01-24 16:58:49,832 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 16:58:49,832 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 16:58:49,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 16:58:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-24 16:58:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 16:58:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-01-24 16:58:49,839 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 33 [2018-01-24 16:58:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:49,840 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-01-24 16:58:49,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:58:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-01-24 16:58:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:58:49,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:49,840 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 16:58:49,840 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 16:58:49,841 INFO L82 PathProgramCache]: Analyzing trace with hash 98146346, now seen corresponding path program 1 times [2018-01-24 16:58:49,841 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:49,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:49,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:49,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:49,842 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:49,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:50,069 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 16:58:50,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:50,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 16:58:50,069 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:50,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 16:58:50,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 16:58:50,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:58:50,071 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 13 states. [2018-01-24 16:58:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:50,412 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2018-01-24 16:58:50,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 16:58:50,415 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-24 16:58:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:50,417 INFO L225 Difference]: With dead ends: 152 [2018-01-24 16:58:50,417 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 16:58:50,418 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-01-24 16:58:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 16:58:50,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2018-01-24 16:58:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 16:58:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-01-24 16:58:50,427 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 33 [2018-01-24 16:58:50,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:50,427 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-01-24 16:58:50,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 16:58:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-01-24 16:58:50,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:58:50,428 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:50,429 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 16:58:50,429 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 16:58:50,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430627, now seen corresponding path program 1 times [2018-01-24 16:58:50,429 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:50,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:50,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:50,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:50,431 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:50,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:50,550 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 16:58:50,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:50,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:58:50,550 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:50,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:58:50,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:58:50,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:58:50,551 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 7 states. [2018-01-24 16:58:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:50,825 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-01-24 16:58:50,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:58:50,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-24 16:58:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:50,827 INFO L225 Difference]: With dead ends: 150 [2018-01-24 16:58:50,828 INFO L226 Difference]: Without dead ends: 148 [2018-01-24 16:58:50,828 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 16:58:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-24 16:58:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-01-24 16:58:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 16:58:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-01-24 16:58:50,839 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 34 [2018-01-24 16:58:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:50,839 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-01-24 16:58:50,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:58:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-01-24 16:58:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:58:50,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:50,840 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 16:58:50,840 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 16:58:50,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430626, now seen corresponding path program 1 times [2018-01-24 16:58:50,841 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:50,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:50,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:50,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:50,842 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:50,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:50,996 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 16:58:50,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:50,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:58:50,996 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:50,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:58:50,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:58:50,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:58:50,997 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 8 states. [2018-01-24 16:58:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:51,261 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-01-24 16:58:51,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:58:51,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-24 16:58:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:51,262 INFO L225 Difference]: With dead ends: 148 [2018-01-24 16:58:51,262 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 16:58:51,262 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 16:58:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 16:58:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-01-24 16:58:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-24 16:58:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-01-24 16:58:51,269 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 34 [2018-01-24 16:58:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:51,269 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-01-24 16:58:51,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:58:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-01-24 16:58:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 16:58:51,270 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:51,270 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 16:58:51,270 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 16:58:51,271 INFO L82 PathProgramCache]: Analyzing trace with hash -994990400, now seen corresponding path program 1 times [2018-01-24 16:58:51,271 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:51,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:51,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:51,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:51,272 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:51,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:51,637 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 16:58:51,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:51,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 16:58:51,638 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:51,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 16:58:51,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 16:58:51,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:58:51,639 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 17 states. [2018-01-24 16:58:52,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:52,076 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2018-01-24 16:58:52,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 16:58:52,077 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-24 16:58:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:52,078 INFO L225 Difference]: With dead ends: 177 [2018-01-24 16:58:52,078 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 16:58:52,079 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 16:58:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 16:58:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-01-24 16:58:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-24 16:58:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2018-01-24 16:58:52,095 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 36 [2018-01-24 16:58:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:52,095 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2018-01-24 16:58:52,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 16:58:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2018-01-24 16:58:52,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 16:58:52,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:52,097 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 16:58:52,097 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 16:58:52,097 INFO L82 PathProgramCache]: Analyzing trace with hash -994990399, now seen corresponding path program 1 times [2018-01-24 16:58:52,097 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:52,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:52,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:52,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:52,098 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:52,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:52,640 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 16:58:52,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:58:52,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 16:58:52,640 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:52,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 16:58:52,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 16:58:52,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:58:52,641 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand 17 states. [2018-01-24 16:58:53,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:58:53,374 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2018-01-24 16:58:53,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:58:53,374 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-24 16:58:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:58:53,376 INFO L225 Difference]: With dead ends: 181 [2018-01-24 16:58:53,376 INFO L226 Difference]: Without dead ends: 180 [2018-01-24 16:58:53,377 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 16:58:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-24 16:58:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-01-24 16:58:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-24 16:58:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-01-24 16:58:53,387 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 36 [2018-01-24 16:58:53,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:58:53,387 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-01-24 16:58:53,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 16:58:53,387 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-01-24 16:58:53,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 16:58:53,388 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:58:53,388 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 16:58:53,388 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 16:58:53,389 INFO L82 PathProgramCache]: Analyzing trace with hash -315835362, now seen corresponding path program 1 times [2018-01-24 16:58:53,389 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:58:53,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:53,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:58:53,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:58:53,389 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:58:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:58:53,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:58:53,516 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 16:58:53,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:58:53,517 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:58:53,517 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-24 16:58:53,519 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 16:58:53,567 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:58:53,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:58:54,019 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 16:58:54,021 INFO L268 AbstractInterpreter]: Visited 49 different actions 79 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-24 16:58:54,031 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 16:58:54,225 INFO L232 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 86.78% of their original sizes. [2018-01-24 16:58:54,225 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 16:58:55,885 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 16:58:55,890 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:58:55,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [11] total 47 [2018-01-24 16:58:55,890 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:58:55,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-24 16:58:55,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-24 16:58:55,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1307, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 16:58:55,891 INFO L87 Difference]: Start difference. First operand 179 states and 193 transitions. Second operand 38 states. [2018-01-24 16:59:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:59:08,900 INFO L93 Difference]: Finished difference Result 250 states and 274 transitions. [2018-01-24 16:59:08,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-24 16:59:08,900 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 50 [2018-01-24 16:59:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:59:08,902 INFO L225 Difference]: With dead ends: 250 [2018-01-24 16:59:08,902 INFO L226 Difference]: Without dead ends: 249 [2018-01-24 16:59:08,904 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 85 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=328, Invalid=5074, Unknown=0, NotChecked=0, Total=5402 [2018-01-24 16:59:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-01-24 16:59:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 219. [2018-01-24 16:59:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-24 16:59:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 238 transitions. [2018-01-24 16:59:08,933 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 238 transitions. Word has length 50 [2018-01-24 16:59:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:59:08,934 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 238 transitions. [2018-01-24 16:59:08,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-24 16:59:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 238 transitions. [2018-01-24 16:59:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 16:59:08,934 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:59:08,935 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 16:59:08,935 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__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 16:59:08,935 INFO L82 PathProgramCache]: Analyzing trace with hash -315835361, now seen corresponding path program 1 times [2018-01-24 16:59:08,935 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:59:08,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:59:08,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:59:08,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:59:08,936 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:59:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:59:08,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:59:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:59:09,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:59:09,749 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:59:09,750 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-24 16:59:09,750 INFO L201 CegarAbsIntRunner]: [0], [1], [4], [7], [10], [13], [14], [15], [16], [21], [23], [27], [55], [56], [58], [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 16:59:09,752 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:59:09,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:59:09,889 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:59:09,889 INFO L268 AbstractInterpreter]: Visited 49 different actions 79 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-24 16:59:09,896 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:59:09,896 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:59:09,896 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:59:09,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:59:09,930 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:59:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:59:09,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:59:10,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:59:10,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:59:10,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:59:10,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:59:10,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:59:10,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:59:10,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-24 16:59:10,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:59:10,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:59:10,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:5 [2018-01-24 16:59:10,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:59:10,406 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:59:10,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:59:10,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:59:10,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:59:10,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-01-24 16:59:10,416 WARN L1029 $PredicateComparison]: unable to prove that (exists ((insert_sub_~sub~10.base Int)) (and (= |c_#length| (store |c_old(#length)| insert_sub_~sub~10.base 12)) (not (= insert_sub_~sub~10.base |c_create_sub_list_#in~sub.base|)))) is different from true [2018-01-24 16:59:10,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:59:10,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-24 16:59:10,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:59:10,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:59:10,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:14 [2018-01-24 16:59:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:59:10,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:59:10,722 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:59:10,722 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:59:10,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-24 16:59:10,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:59:10,733 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:59:10,734 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:59:10,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-01-24 16:59:10,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:59:10,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 16:59:10,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:20 [2018-01-24 16:59:27,003 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-01-24 16:59:27,034 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 93503 column 11: unknown constant v_insert_sub_~sub~10.base_14 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1362) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:582) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:146) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:200) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:120) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.checkEqualityStatus(Elim1Store.java:667) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:759) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 16:59:27,037 INFO L168 Benchmark]: Toolchain (without parser) took 41179.20 ms. Allocated memory was 307.8 MB in the beginning and 826.8 MB in the end (delta: 519.0 MB). Free memory was 267.8 MB in the beginning and 620.6 MB in the end (delta: -352.8 MB). Peak memory consumption was 166.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:59:27,038 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:59:27,038 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.86 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 255.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:59:27,039 INFO L168 Benchmark]: Boogie Preprocessor took 38.97 ms. Allocated memory is still 307.8 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:59:27,039 INFO L168 Benchmark]: RCFGBuilder took 480.92 ms. Allocated memory is still 307.8 MB. Free memory was 253.8 MB in the beginning and 222.8 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:59:27,039 INFO L168 Benchmark]: TraceAbstraction took 40436.35 ms. Allocated memory was 307.8 MB in the beginning and 826.8 MB in the end (delta: 519.0 MB). Free memory was 222.8 MB in the beginning and 620.6 MB in the end (delta: -397.7 MB). Peak memory consumption was 121.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:59:27,041 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.86 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 255.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.97 ms. Allocated memory is still 307.8 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 480.92 ms. Allocated memory is still 307.8 MB. Free memory was 253.8 MB in the beginning and 222.8 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 40436.35 ms. Allocated memory was 307.8 MB in the beginning and 826.8 MB in the end (delta: 519.0 MB). Free memory was 222.8 MB in the beginning and 620.6 MB in the end (delta: -397.7 MB). Peak memory consumption was 121.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 47 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 552 LocStat_NO_SUPPORTING_DISEQUALITIES : 178 LocStat_NO_DISJUNCTIONS : -94 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 65 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 155 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 67 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.029996 RENAME_VARIABLES(MILLISECONDS) : 0.100471 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001332 PROJECTAWAY(MILLISECONDS) : 0.051675 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001161 DISJOIN(MILLISECONDS) : 0.490654 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.124371 ADD_EQUALITY(MILLISECONDS) : 0.027577 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015051 #CONJOIN_DISJUNCTIVE : 125 #RENAME_VARIABLES : 209 #UNFREEZE : 0 #CONJOIN : 308 #PROJECTAWAY : 185 #ADD_WEAK_EQUALITY : 61 #DISJOIN : 30 #RENAME_VARIABLES_DISJUNCTIVE : 206 #ADD_EQUALITY : 192 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 48 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 562 LocStat_NO_SUPPORTING_DISEQUALITIES : 180 LocStat_NO_DISJUNCTIONS : -96 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 65 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 157 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 68 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.012431 RENAME_VARIABLES(MILLISECONDS) : 0.040513 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.000730 PROJECTAWAY(MILLISECONDS) : 0.025678 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000796 DISJOIN(MILLISECONDS) : 0.248607 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.051102 ADD_EQUALITY(MILLISECONDS) : 0.009132 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006423 #CONJOIN_DISJUNCTIVE : 125 #RENAME_VARIABLES : 211 #UNFREEZE : 0 #CONJOIN : 310 #PROJECTAWAY : 190 #ADD_WEAK_EQUALITY : 61 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 206 #ADD_EQUALITY : 194 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 93503 column 11: unknown constant v_insert_sub_~sub~10.base_14 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 93503 column 11: unknown constant v_insert_sub_~sub~10.base_14: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1362) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-59-27-052.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-59-27-052.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-59-27-052.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-59-27-052.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0102_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-59-27-052.csv Received shutdown request...