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_smtcomp.epf -i ../../../trunk/examples/svcomp/memsafety/test-0102_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:38:16,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:38:16,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:38:16,316 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:38:16,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:38:16,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:38:16,319 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:38:16,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:38:16,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:38:16,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:38:16,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:38:16,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:38:16,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:38:16,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:38:16,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:38:16,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:38:16,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:38:16,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:38:16,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:38:16,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:38:16,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:38:16,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:38:16,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:38:16,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:38:16,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:38:16,346 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:38:16,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:38:16,347 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:38:16,347 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:38:16,347 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:38:16,348 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:38:16,348 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_smtcomp.epf [2018-01-25 05:38:16,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:38:16,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:38:16,357 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:38:16,358 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:38:16,358 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:38:16,358 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:38:16,358 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:38:16,358 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:38:16,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:38:16,359 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:38:16,359 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:38:16,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:38:16,359 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:38:16,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:38:16,359 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:38:16,359 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:38:16,359 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:38:16,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:38:16,360 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:38:16,360 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:38:16,360 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:38:16,360 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:38:16,360 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:38:16,361 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:38:16,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:38:16,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:38:16,361 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:38:16,361 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:38:16,361 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:38:16,362 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:38:16,362 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:38:16,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:38:16,362 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:38:16,362 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:38:16,363 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:38:16,363 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:38:16,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:38:16,407 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:38:16,410 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:38:16,412 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:38:16,412 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:38:16,412 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-25 05:38:16,606 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:38:16,611 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:38:16,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:38:16,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:38:16,617 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:38:16,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:38:16" (1/1) ... [2018-01-25 05:38:16,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321f72c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:16, skipping insertion in model container [2018-01-25 05:38:16,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:38:16" (1/1) ... [2018-01-25 05:38:16,634 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:38:16,676 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:38:16,809 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:38:16,835 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:38:16,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:16 WrapperNode [2018-01-25 05:38:16,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:38:16,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:38:16,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:38:16,847 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:38:16,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:16" (1/1) ... [2018-01-25 05:38:16,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:16" (1/1) ... [2018-01-25 05:38:16,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:16" (1/1) ... [2018-01-25 05:38:16,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:16" (1/1) ... [2018-01-25 05:38:16,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:16" (1/1) ... [2018-01-25 05:38:16,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:16" (1/1) ... [2018-01-25 05:38:16,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:16" (1/1) ... [2018-01-25 05:38:16,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:38:16,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:38:16,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:38:16,892 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:38:16,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:38:16,949 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:38:16,949 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:38:16,949 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-25 05:38:16,949 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add_tail [2018-01-25 05:38:16,950 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_sub [2018-01-25 05:38:16,950 INFO L136 BoogieDeclarations]: Found implementation of procedure destroy_top [2018-01-25 05:38:16,950 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_sub [2018-01-25 05:38:16,950 INFO L136 BoogieDeclarations]: Found implementation of procedure create_sub_list [2018-01-25 05:38:16,950 INFO L136 BoogieDeclarations]: Found implementation of procedure insert_top [2018-01-25 05:38:16,950 INFO L136 BoogieDeclarations]: Found implementation of procedure create_top [2018-01-25 05:38:16,951 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:38:16,951 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:38:16,951 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:38:16,951 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:38:16,951 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:38:16,951 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:38:16,952 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:38:16,952 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:38:16,952 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:38:16,952 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 05:38:16,952 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:38:16,952 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-25 05:38:16,953 INFO L128 BoogieDeclarations]: Found specification of procedure list_add_tail [2018-01-25 05:38:16,953 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_sub [2018-01-25 05:38:16,953 INFO L128 BoogieDeclarations]: Found specification of procedure destroy_top [2018-01-25 05:38:16,953 INFO L128 BoogieDeclarations]: Found specification of procedure insert_sub [2018-01-25 05:38:16,953 INFO L128 BoogieDeclarations]: Found specification of procedure create_sub_list [2018-01-25 05:38:16,953 INFO L128 BoogieDeclarations]: Found specification of procedure insert_top [2018-01-25 05:38:16,954 INFO L128 BoogieDeclarations]: Found specification of procedure create_top [2018-01-25 05:38:16,954 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:38:16,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:38:16,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:38:17,358 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:38:17,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:38:17 BoogieIcfgContainer [2018-01-25 05:38:17,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:38:17,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:38:17,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:38:17,362 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:38:17,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:38:16" (1/3) ... [2018-01-25 05:38:17,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482ba7c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:38:17, skipping insertion in model container [2018-01-25 05:38:17,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:38:16" (2/3) ... [2018-01-25 05:38:17,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482ba7c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:38:17, skipping insertion in model container [2018-01-25 05:38:17,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:38:17" (3/3) ... [2018-01-25 05:38:17,365 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0102_false-valid-memtrack.i [2018-01-25 05:38:17,373 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:38:17,380 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-01-25 05:38:17,422 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:38:17,422 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:38:17,423 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:38:17,423 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:38:17,423 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:38:17,423 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:38:17,423 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:38:17,423 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:38:17,424 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:38:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-01-25 05:38:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 05:38:17,451 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:17,452 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:17,452 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-25 05:38:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash -475500327, now seen corresponding path program 1 times [2018-01-25 05:38:17,459 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:17,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:17,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:17,503 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:17,503 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:17,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:17,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:17,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:38:17,606 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:17,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:38:17,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:38:17,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:17,711 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2018-01-25 05:38:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:17,878 INFO L93 Difference]: Finished difference Result 224 states and 252 transitions. [2018-01-25 05:38:17,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:38:17,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 05:38:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:17,891 INFO L225 Difference]: With dead ends: 224 [2018-01-25 05:38:17,891 INFO L226 Difference]: Without dead ends: 114 [2018-01-25 05:38:17,895 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-25 05:38:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-25 05:38:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 05:38:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-25 05:38:17,938 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 7 [2018-01-25 05:38:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:17,938 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-25 05:38:17,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:38:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-25 05:38:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 05:38:17,939 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:17,939 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:17,940 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-25 05:38:17,940 INFO L82 PathProgramCache]: Analyzing trace with hash -475500326, now seen corresponding path program 1 times [2018-01-25 05:38:17,940 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:17,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:17,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:17,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:17,942 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:17,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:17,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:17,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:38:17,999 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:18,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:38:18,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:38:18,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:18,002 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 3 states. [2018-01-25 05:38:18,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:18,084 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-25 05:38:18,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:38:18,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 05:38:18,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:18,087 INFO L225 Difference]: With dead ends: 114 [2018-01-25 05:38:18,087 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 05:38:18,088 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:38:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 05:38:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-25 05:38:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 05:38:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-25 05:38:18,102 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 7 [2018-01-25 05:38:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:18,103 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-25 05:38:18,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:38:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-25 05:38:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:38:18,104 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:18,104 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:18,104 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-25 05:38:18,104 INFO L82 PathProgramCache]: Analyzing trace with hash 644933486, now seen corresponding path program 1 times [2018-01-25 05:38:18,104 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:18,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:18,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:18,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:18,106 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:18,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:18,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:18,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:38:18,206 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:18,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:38:18,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:38:18,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:38:18,207 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 6 states. [2018-01-25 05:38:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:18,495 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-25 05:38:18,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:38:18,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 05:38:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:18,499 INFO L225 Difference]: With dead ends: 122 [2018-01-25 05:38:18,499 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 05:38:18,499 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-25 05:38:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 05:38:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-01-25 05:38:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 05:38:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-01-25 05:38:18,515 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 19 [2018-01-25 05:38:18,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:18,515 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-01-25 05:38:18,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:38:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-01-25 05:38:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 05:38:18,516 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:18,516 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:18,517 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-25 05:38:18,517 INFO L82 PathProgramCache]: Analyzing trace with hash 644933487, now seen corresponding path program 1 times [2018-01-25 05:38:18,517 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:18,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:18,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:18,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:18,518 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:18,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:18,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:18,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:38:18,664 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:18,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:38:18,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:38:18,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:38:18,665 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 6 states. [2018-01-25 05:38:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:18,818 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-01-25 05:38:18,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:38:18,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 05:38:18,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:18,819 INFO L225 Difference]: With dead ends: 118 [2018-01-25 05:38:18,820 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 05:38:18,820 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-25 05:38:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 05:38:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-01-25 05:38:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 05:38:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-01-25 05:38:18,829 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 19 [2018-01-25 05:38:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:18,829 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-01-25 05:38:18,829 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:38:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-01-25 05:38:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:38:18,830 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:18,830 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-25 05:38:18,830 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-25 05:38:18,830 INFO L82 PathProgramCache]: Analyzing trace with hash 264154241, now seen corresponding path program 1 times [2018-01-25 05:38:18,830 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:18,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:18,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:18,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:18,831 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:18,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:18,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:18,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:38:18,928 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:18,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:38:18,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:38:18,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:38:18,929 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 4 states. [2018-01-25 05:38:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:19,026 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-25 05:38:19,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:38:19,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-25 05:38:19,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:19,028 INFO L225 Difference]: With dead ends: 114 [2018-01-25 05:38:19,028 INFO L226 Difference]: Without dead ends: 113 [2018-01-25 05:38:19,028 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:38:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-25 05:38:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-25 05:38:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-25 05:38:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-01-25 05:38:19,041 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 27 [2018-01-25 05:38:19,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:19,041 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-01-25 05:38:19,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:38:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-01-25 05:38:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:38:19,043 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:19,043 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-25 05:38:19,043 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-25 05:38:19,043 INFO L82 PathProgramCache]: Analyzing trace with hash 264154242, now seen corresponding path program 1 times [2018-01-25 05:38:19,043 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:19,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:19,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:19,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:19,044 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:19,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:19,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:19,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:38:19,149 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:19,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:38:19,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:38:19,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:38:19,150 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-01-25 05:38:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:19,229 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-01-25 05:38:19,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:38:19,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-25 05:38:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:19,231 INFO L225 Difference]: With dead ends: 113 [2018-01-25 05:38:19,231 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 05:38:19,231 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-25 05:38:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 05:38:19,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-01-25 05:38:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 05:38:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-01-25 05:38:19,241 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 27 [2018-01-25 05:38:19,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:19,242 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-01-25 05:38:19,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:38:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-01-25 05:38:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:38:19,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:19,243 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:19,243 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-25 05:38:19,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036196, now seen corresponding path program 1 times [2018-01-25 05:38:19,244 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:19,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:19,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:19,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:19,245 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:19,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:19,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:19,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:38:19,431 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:19,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:38:19,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:38:19,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:38:19,432 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 9 states. [2018-01-25 05:38:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:19,710 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-25 05:38:19,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:38:19,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-25 05:38:19,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:19,711 INFO L225 Difference]: With dead ends: 120 [2018-01-25 05:38:19,712 INFO L226 Difference]: Without dead ends: 119 [2018-01-25 05:38:19,712 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-25 05:38:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-25 05:38:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-01-25 05:38:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-25 05:38:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-01-25 05:38:19,719 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 30 [2018-01-25 05:38:19,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:19,719 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-01-25 05:38:19,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:38:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-01-25 05:38:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:38:19,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:19,720 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:19,720 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-25 05:38:19,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1039036197, now seen corresponding path program 1 times [2018-01-25 05:38:19,720 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:19,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:19,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:19,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:19,721 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:19,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:19,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:19,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:38:19,989 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:19,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:38:19,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:38:19,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:38:19,990 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 11 states. [2018-01-25 05:38:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:20,458 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-01-25 05:38:20,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:38:20,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-25 05:38:20,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:20,460 INFO L225 Difference]: With dead ends: 141 [2018-01-25 05:38:20,461 INFO L226 Difference]: Without dead ends: 140 [2018-01-25 05:38:20,461 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-25 05:38:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-25 05:38:20,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-01-25 05:38:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-25 05:38:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-01-25 05:38:20,472 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 30 [2018-01-25 05:38:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:20,472 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-01-25 05:38:20,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:38:20,473 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-01-25 05:38:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:38:20,474 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:20,474 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:20,474 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-25 05:38:20,474 INFO L82 PathProgramCache]: Analyzing trace with hash 98146345, now seen corresponding path program 1 times [2018-01-25 05:38:20,474 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:20,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:20,475 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:20,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:20,476 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:20,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:20,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:20,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:38:20,536 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:20,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:38:20,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:38:20,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:38:20,537 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 5 states. [2018-01-25 05:38:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:20,663 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-01-25 05:38:20,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:38:20,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-25 05:38:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:20,665 INFO L225 Difference]: With dead ends: 138 [2018-01-25 05:38:20,665 INFO L226 Difference]: Without dead ends: 137 [2018-01-25 05:38:20,665 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-25 05:38:20,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-25 05:38:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-01-25 05:38:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-25 05:38:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-01-25 05:38:20,673 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 33 [2018-01-25 05:38:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:20,673 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-01-25 05:38:20,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:38:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-01-25 05:38:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:38:20,674 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:20,674 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:38:20,674 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-25 05:38:20,675 INFO L82 PathProgramCache]: Analyzing trace with hash 98146346, now seen corresponding path program 1 times [2018-01-25 05:38:20,675 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:20,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:20,676 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:20,676 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:20,676 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:20,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:20,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:20,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 05:38:20,880 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:20,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:38:20,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:38:20,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:38:20,881 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 13 states. [2018-01-25 05:38:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:21,158 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2018-01-25 05:38:21,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:38:21,159 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-25 05:38:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:21,161 INFO L225 Difference]: With dead ends: 152 [2018-01-25 05:38:21,162 INFO L226 Difference]: Without dead ends: 151 [2018-01-25 05:38:21,162 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:38:21,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-25 05:38:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2018-01-25 05:38:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-25 05:38:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-01-25 05:38:21,176 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 33 [2018-01-25 05:38:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:21,176 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-01-25 05:38:21,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:38:21,177 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-01-25 05:38:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:38:21,178 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:21,178 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-25 05:38:21,178 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-25 05:38:21,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430627, now seen corresponding path program 1 times [2018-01-25 05:38:21,179 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:21,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:21,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:21,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:21,180 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:21,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:21,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:21,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:38:21,271 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:21,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:38:21,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:38:21,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:38:21,273 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 7 states. [2018-01-25 05:38:21,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:21,515 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-01-25 05:38:21,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:38:21,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-25 05:38:21,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:21,517 INFO L225 Difference]: With dead ends: 150 [2018-01-25 05:38:21,518 INFO L226 Difference]: Without dead ends: 148 [2018-01-25 05:38:21,518 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-25 05:38:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-25 05:38:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-01-25 05:38:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 05:38:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-01-25 05:38:21,528 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 34 [2018-01-25 05:38:21,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:21,529 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-01-25 05:38:21,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:38:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-01-25 05:38:21,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:38:21,530 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:21,530 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-25 05:38:21,530 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-25 05:38:21,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1252430626, now seen corresponding path program 1 times [2018-01-25 05:38:21,530 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:21,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:21,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:21,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:21,532 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:21,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:21,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:21,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:38:21,747 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:21,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:38:21,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:38:21,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:38:21,748 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 8 states. [2018-01-25 05:38:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:22,066 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2018-01-25 05:38:22,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:38:22,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-25 05:38:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:22,067 INFO L225 Difference]: With dead ends: 148 [2018-01-25 05:38:22,068 INFO L226 Difference]: Without dead ends: 146 [2018-01-25 05:38:22,068 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:38:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-25 05:38:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-01-25 05:38:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 05:38:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-01-25 05:38:22,078 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 34 [2018-01-25 05:38:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:22,079 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-01-25 05:38:22,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:38:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-01-25 05:38:22,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 05:38:22,080 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:22,080 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-25 05:38:22,080 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-25 05:38:22,080 INFO L82 PathProgramCache]: Analyzing trace with hash -994990400, now seen corresponding path program 1 times [2018-01-25 05:38:22,080 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:22,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:22,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:22,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:22,082 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:22,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:22,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:22,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 05:38:22,471 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:22,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:38:22,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:38:22,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-25 05:38:22,472 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 17 states. [2018-01-25 05:38:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:22,958 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2018-01-25 05:38:22,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 05:38:22,958 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-25 05:38:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:22,959 INFO L225 Difference]: With dead ends: 177 [2018-01-25 05:38:22,960 INFO L226 Difference]: Without dead ends: 176 [2018-01-25 05:38:22,960 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-25 05:38:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-25 05:38:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-01-25 05:38:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-25 05:38:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 187 transitions. [2018-01-25 05:38:22,977 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 187 transitions. Word has length 36 [2018-01-25 05:38:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:22,977 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 187 transitions. [2018-01-25 05:38:22,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:38:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 187 transitions. [2018-01-25 05:38:22,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 05:38:22,978 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:22,978 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-25 05:38:22,978 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-25 05:38:22,978 INFO L82 PathProgramCache]: Analyzing trace with hash -994990399, now seen corresponding path program 1 times [2018-01-25 05:38:22,978 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:22,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:22,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:22,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:22,979 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:23,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:38:23,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:38:23,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 05:38:23,681 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:38:23,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 05:38:23,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 05:38:23,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-25 05:38:23,682 INFO L87 Difference]: Start difference. First operand 172 states and 187 transitions. Second operand 17 states. [2018-01-25 05:38:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:38:24,391 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2018-01-25 05:38:24,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:38:24,391 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-25 05:38:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:38:24,392 INFO L225 Difference]: With dead ends: 181 [2018-01-25 05:38:24,392 INFO L226 Difference]: Without dead ends: 180 [2018-01-25 05:38:24,393 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-25 05:38:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-25 05:38:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-01-25 05:38:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-25 05:38:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 193 transitions. [2018-01-25 05:38:24,408 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 193 transitions. Word has length 36 [2018-01-25 05:38:24,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:38:24,408 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 193 transitions. [2018-01-25 05:38:24,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 05:38:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2018-01-25 05:38:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-25 05:38:24,409 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:38:24,409 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-25 05:38:24,410 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-25 05:38:24,410 INFO L82 PathProgramCache]: Analyzing trace with hash -315835362, now seen corresponding path program 1 times [2018-01-25 05:38:24,410 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:38:24,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:24,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:38:24,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:38:24,411 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:38:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:38:24,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:38:24,549 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-25 05:38:24,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:38:24,549 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:38:24,550 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-01-25 05:38:24,551 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-25 05:38:24,595 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:38:24,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 05:39:19,563 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 05:39:19,564 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 05:39:19,565 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:39:19,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:39:19,565 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-25 05:39:19,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:39:19,571 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:39:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:39:19,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:39:19,642 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:39:19,642 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:39:19,648 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:39:19,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:39:19 BoogieIcfgContainer [2018-01-25 05:39:19,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:39:19,649 INFO L168 Benchmark]: Toolchain (without parser) took 63042.93 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 265.7 MB in the beginning and 952.8 MB in the end (delta: -687.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-25 05:39:19,650 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:39:19,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.50 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 253.4 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 5.3 GB. [2018-01-25 05:39:19,651 INFO L168 Benchmark]: Boogie Preprocessor took 44.69 ms. Allocated memory is still 305.7 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:39:19,651 INFO L168 Benchmark]: RCFGBuilder took 467.49 ms. Allocated memory is still 305.7 MB. Free memory was 251.4 MB in the beginning and 220.8 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:39:19,652 INFO L168 Benchmark]: TraceAbstraction took 62288.29 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 220.8 MB in the beginning and 952.8 MB in the end (delta: -732.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-25 05:39:19,654 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.13 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.50 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 253.4 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.69 ms. Allocated memory is still 305.7 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 467.49 ms. Allocated memory is still 305.7 MB. Free memory was 251.4 MB in the beginning and 220.8 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62288.29 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 220.8 MB in the beginning and 952.8 MB in the end (delta: -732.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 629). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 695]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 695). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 51 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 2 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 119 locations, 33 error locations. TIMEOUT Result, 62.2s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1473 SDtfs, 305 SDslu, 5925 SDs, 0 SdLazy, 3449 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 55.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 32 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 52409 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-39-19-662.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-39-19-662.csv Completed graceful shutdown