java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:29:28,529 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:29:28,532 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:29:28,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:29:28,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:29:28,546 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:29:28,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:29:28,549 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:29:28,552 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:29:28,553 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:29:28,554 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:29:28,554 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:29:28,555 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:29:28,557 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:29:28,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:29:28,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:29:28,563 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:29:28,565 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:29:28,566 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:29:28,567 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:29:28,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:29:28,570 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:29:28,570 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:29:28,571 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:29:28,572 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:29:28,573 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:29:28,573 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:29:28,574 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:29:28,574 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:29:28,575 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:29:28,575 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:29:28,575 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:29:28,586 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:29:28,586 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:29:28,587 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:29:28,587 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:29:28,588 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:29:28,588 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:29:28,588 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:29:28,588 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:29:28,589 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:29:28,589 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:29:28,589 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:29:28,589 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:29:28,590 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:29:28,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:29:28,590 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:29:28,590 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:29:28,590 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:29:28,591 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:29:28,591 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:29:28,591 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:29:28,591 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:29:28,591 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:29:28,592 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:29:28,592 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:29:28,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:29:28,592 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:29:28,593 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:29:28,593 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:29:28,593 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:29:28,593 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:29:28,593 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:29:28,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:29:28,594 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:29:28,594 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:29:28,595 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:29:28,595 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:29:28,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:29:28,643 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:29:28,648 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:29:28,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:29:28,650 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:29:28,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i [2018-01-24 17:29:28,833 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:29:28,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:29:28,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:29:28,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:29:28,849 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:29:28,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:29:28" (1/1) ... [2018-01-24 17:29:28,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc85fef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:29:28, skipping insertion in model container [2018-01-24 17:29:28,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:29:28" (1/1) ... [2018-01-24 17:29:28,875 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:29:28,935 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:29:29,099 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:29:29,122 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:29:29,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:29:29 WrapperNode [2018-01-24 17:29:29,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:29:29,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:29:29,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:29:29,134 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:29:29,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:29:29" (1/1) ... [2018-01-24 17:29:29,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:29:29" (1/1) ... [2018-01-24 17:29:29,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:29:29" (1/1) ... [2018-01-24 17:29:29,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:29:29" (1/1) ... [2018-01-24 17:29:29,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:29:29" (1/1) ... [2018-01-24 17:29:29,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:29:29" (1/1) ... [2018-01-24 17:29:29,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:29:29" (1/1) ... [2018-01-24 17:29:29,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:29:29,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:29:29,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:29:29,186 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:29:29,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:29:29" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:29:29,234 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:29:29,235 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:29:29,235 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-24 17:29:29,235 INFO L136 BoogieDeclarations]: Found implementation of procedure remove [2018-01-24 17:29:29,235 INFO L136 BoogieDeclarations]: Found implementation of procedure re_insert [2018-01-24 17:29:29,235 INFO L136 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2018-01-24 17:29:29,236 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:29:29,236 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:29:29,236 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:29:29,236 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:29:29,236 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:29:29,236 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:29:29,236 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-24 17:29:29,237 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-01-24 17:29:29,237 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 17:29:29,237 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-24 17:29:29,237 INFO L128 BoogieDeclarations]: Found specification of procedure remove [2018-01-24 17:29:29,237 INFO L128 BoogieDeclarations]: Found specification of procedure re_insert [2018-01-24 17:29:29,237 INFO L128 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2018-01-24 17:29:29,238 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:29:29,238 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:29:29,238 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:29:29,647 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:29:29,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:29:29 BoogieIcfgContainer [2018-01-24 17:29:29,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:29:29,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:29:29,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:29:29,652 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:29:29,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:29:28" (1/3) ... [2018-01-24 17:29:29,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d56b822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:29:29, skipping insertion in model container [2018-01-24 17:29:29,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:29:29" (2/3) ... [2018-01-24 17:29:29,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d56b822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:29:29, skipping insertion in model container [2018-01-24 17:29:29,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:29:29" (3/3) ... [2018-01-24 17:29:29,657 INFO L105 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2018-01-24 17:29:29,667 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:29:29,676 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-24 17:29:29,729 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:29:29,729 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:29:29,729 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:29:29,729 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:29:29,730 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:29:29,730 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:29:29,730 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:29:29,730 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:29:29,731 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:29:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-01-24 17:29:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 17:29:29,762 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:29:29,764 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:29:29,764 INFO L371 AbstractCegarLoop]: === Iteration 1 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-24 17:29:29,769 INFO L82 PathProgramCache]: Analyzing trace with hash 436525791, now seen corresponding path program 1 times [2018-01-24 17:29:29,772 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:29:29,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:29,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:29:29,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:29,833 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:29:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:29:29,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:29:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:29:29,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:29:29,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:29:29,948 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:29:29,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:29:29,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:29:29,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:29:29,970 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2018-01-24 17:29:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:29:30,175 INFO L93 Difference]: Finished difference Result 216 states and 244 transitions. [2018-01-24 17:29:30,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:29:30,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 17:29:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:29:30,185 INFO L225 Difference]: With dead ends: 216 [2018-01-24 17:29:30,185 INFO L226 Difference]: Without dead ends: 116 [2018-01-24 17:29:30,189 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:29:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-24 17:29:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-01-24 17:29:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-24 17:29:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-01-24 17:29:30,232 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 7 [2018-01-24 17:29:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:29:30,232 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-01-24 17:29:30,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:29:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-01-24 17:29:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 17:29:30,233 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:29:30,233 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:29:30,233 INFO L371 AbstractCegarLoop]: === Iteration 2 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-24 17:29:30,233 INFO L82 PathProgramCache]: Analyzing trace with hash 436525792, now seen corresponding path program 1 times [2018-01-24 17:29:30,233 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:29:30,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:30,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:29:30,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:30,235 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:29:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:29:30,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:29:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:29:30,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:29:30,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:29:30,294 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:29:30,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:29:30,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:29:30,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:29:30,296 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 3 states. [2018-01-24 17:29:30,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:29:30,428 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-01-24 17:29:30,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:29:30,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 17:29:30,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:29:30,429 INFO L225 Difference]: With dead ends: 116 [2018-01-24 17:29:30,430 INFO L226 Difference]: Without dead ends: 114 [2018-01-24 17:29:30,431 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:29:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-24 17:29:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-01-24 17:29:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 17:29:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-01-24 17:29:30,443 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 7 [2018-01-24 17:29:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:29:30,443 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-01-24 17:29:30,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:29:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-01-24 17:29:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 17:29:30,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:29:30,444 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:29:30,444 INFO L371 AbstractCegarLoop]: === Iteration 3 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-24 17:29:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash -711243012, now seen corresponding path program 1 times [2018-01-24 17:29:30,444 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:29:30,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:30,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:29:30,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:30,445 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:29:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:29:30,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:29:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:29:30,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:29:30,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:29:30,531 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:29:30,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:29:30,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:29:30,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:29:30,532 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 5 states. [2018-01-24 17:29:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:29:30,629 INFO L93 Difference]: Finished difference Result 239 states and 278 transitions. [2018-01-24 17:29:30,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:29:30,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 17:29:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:29:30,633 INFO L225 Difference]: With dead ends: 239 [2018-01-24 17:29:30,633 INFO L226 Difference]: Without dead ends: 150 [2018-01-24 17:29:30,635 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:29:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-24 17:29:30,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-01-24 17:29:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 17:29:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2018-01-24 17:29:30,650 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 15 [2018-01-24 17:29:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:29:30,650 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2018-01-24 17:29:30,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:29:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2018-01-24 17:29:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 17:29:30,651 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:29:30,651 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:29:30,651 INFO L371 AbstractCegarLoop]: === Iteration 4 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-24 17:29:30,651 INFO L82 PathProgramCache]: Analyzing trace with hash -714029430, now seen corresponding path program 1 times [2018-01-24 17:29:30,651 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:29:30,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:30,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:29:30,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:30,653 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:29:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:29:30,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:29:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:29:30,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:29:30,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:29:30,711 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:29:30,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:29:30,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:29:30,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:29:30,712 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand 4 states. [2018-01-24 17:29:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:29:30,911 INFO L93 Difference]: Finished difference Result 156 states and 193 transitions. [2018-01-24 17:29:30,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:29:30,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 17:29:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:29:30,913 INFO L225 Difference]: With dead ends: 156 [2018-01-24 17:29:30,913 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 17:29:30,914 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:29:30,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 17:29:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2018-01-24 17:29:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-01-24 17:29:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2018-01-24 17:29:30,932 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 15 [2018-01-24 17:29:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:29:30,933 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2018-01-24 17:29:30,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:29:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2018-01-24 17:29:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 17:29:30,934 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:29:30,934 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:29:30,934 INFO L371 AbstractCegarLoop]: === Iteration 5 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-24 17:29:30,935 INFO L82 PathProgramCache]: Analyzing trace with hash -714029429, now seen corresponding path program 1 times [2018-01-24 17:29:30,935 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:29:30,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:30,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:29:30,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:30,936 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:29:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:29:30,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:29:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:29:31,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:29:31,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:29:31,014 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:29:31,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:29:31,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:29:31,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:29:31,015 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 4 states. [2018-01-24 17:29:31,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:29:31,136 INFO L93 Difference]: Finished difference Result 157 states and 191 transitions. [2018-01-24 17:29:31,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:29:31,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 17:29:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:29:31,138 INFO L225 Difference]: With dead ends: 157 [2018-01-24 17:29:31,138 INFO L226 Difference]: Without dead ends: 155 [2018-01-24 17:29:31,139 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:29:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-24 17:29:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2018-01-24 17:29:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 17:29:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2018-01-24 17:29:31,156 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 15 [2018-01-24 17:29:31,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:29:31,156 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2018-01-24 17:29:31,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:29:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2018-01-24 17:29:31,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:29:31,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:29:31,157 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:29:31,158 INFO L371 AbstractCegarLoop]: === Iteration 6 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-24 17:29:31,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485069, now seen corresponding path program 1 times [2018-01-24 17:29:31,158 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:29:31,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:31,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:29:31,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:31,159 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:29:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:29:31,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:29:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:29:31,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:29:31,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:29:31,255 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:29:31,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:29:31,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:29:31,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:29:31,256 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand 6 states. [2018-01-24 17:29:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:29:31,434 INFO L93 Difference]: Finished difference Result 134 states and 158 transitions. [2018-01-24 17:29:31,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:29:31,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-01-24 17:29:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:29:31,437 INFO L225 Difference]: With dead ends: 134 [2018-01-24 17:29:31,437 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 17:29:31,437 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:29:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 17:29:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-01-24 17:29:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 17:29:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2018-01-24 17:29:31,450 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 17 [2018-01-24 17:29:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:29:31,451 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2018-01-24 17:29:31,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:29:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2018-01-24 17:29:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:29:31,452 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:29:31,452 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:29:31,452 INFO L371 AbstractCegarLoop]: === Iteration 7 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-24 17:29:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485070, now seen corresponding path program 1 times [2018-01-24 17:29:31,452 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:29:31,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:31,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:29:31,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:31,454 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:29:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:29:31,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:29:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:29:31,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:29:31,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:29:31,552 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:29:31,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:29:31,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:29:31,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:29:31,552 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand 4 states. [2018-01-24 17:29:31,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:29:31,685 INFO L93 Difference]: Finished difference Result 133 states and 156 transitions. [2018-01-24 17:29:31,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:29:31,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 17:29:31,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:29:31,687 INFO L225 Difference]: With dead ends: 133 [2018-01-24 17:29:31,687 INFO L226 Difference]: Without dead ends: 132 [2018-01-24 17:29:31,687 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:29:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-24 17:29:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-24 17:29:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-24 17:29:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-01-24 17:29:31,697 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 17 [2018-01-24 17:29:31,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:29:31,698 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-01-24 17:29:31,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:29:31,698 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-01-24 17:29:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 17:29:31,699 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:29:31,699 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] [2018-01-24 17:29:31,699 INFO L371 AbstractCegarLoop]: === Iteration 8 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-24 17:29:31,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937321, now seen corresponding path program 1 times [2018-01-24 17:29:31,699 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:29:31,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:31,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:29:31,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:31,700 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:29:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:29:31,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:29:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:29:31,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:29:31,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:29:31,739 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:29:31,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:29:31,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:29:31,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:29:31,740 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 6 states. [2018-01-24 17:29:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:29:31,982 INFO L93 Difference]: Finished difference Result 161 states and 190 transitions. [2018-01-24 17:29:31,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:29:31,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 17:29:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:29:31,983 INFO L225 Difference]: With dead ends: 161 [2018-01-24 17:29:31,983 INFO L226 Difference]: Without dead ends: 155 [2018-01-24 17:29:31,984 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:29:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-24 17:29:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2018-01-24 17:29:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 17:29:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 175 transitions. [2018-01-24 17:29:31,994 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 175 transitions. Word has length 20 [2018-01-24 17:29:31,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:29:31,995 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 175 transitions. [2018-01-24 17:29:31,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:29:31,995 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2018-01-24 17:29:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 17:29:31,995 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:29:31,995 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] [2018-01-24 17:29:31,996 INFO L371 AbstractCegarLoop]: === Iteration 9 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-24 17:29:31,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937322, now seen corresponding path program 1 times [2018-01-24 17:29:31,996 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:29:31,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:31,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:29:31,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:31,997 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:29:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:29:32,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:29:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:29:32,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:29:32,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:29:32,093 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:29:32,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:29:32,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:29:32,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:29:32,094 INFO L87 Difference]: Start difference. First operand 142 states and 175 transitions. Second operand 6 states. [2018-01-24 17:29:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:29:32,443 INFO L93 Difference]: Finished difference Result 158 states and 181 transitions. [2018-01-24 17:29:32,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:29:32,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 17:29:32,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:29:32,445 INFO L225 Difference]: With dead ends: 158 [2018-01-24 17:29:32,445 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 17:29:32,445 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:29:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 17:29:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2018-01-24 17:29:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 17:29:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 169 transitions. [2018-01-24 17:29:32,455 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 169 transitions. Word has length 20 [2018-01-24 17:29:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:29:32,456 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 169 transitions. [2018-01-24 17:29:32,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:29:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 169 transitions. [2018-01-24 17:29:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 17:29:32,457 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:29:32,457 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] [2018-01-24 17:29:32,457 INFO L371 AbstractCegarLoop]: === Iteration 10 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-24 17:29:32,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2044804781, now seen corresponding path program 1 times [2018-01-24 17:29:32,458 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:29:32,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:32,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:29:32,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:32,459 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:29:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:29:32,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:29:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:29:32,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:29:32,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:29:32,599 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:29:32,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:29:32,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:29:32,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:29:32,599 INFO L87 Difference]: Start difference. First operand 142 states and 169 transitions. Second operand 9 states. [2018-01-24 17:29:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:29:32,843 INFO L93 Difference]: Finished difference Result 233 states and 275 transitions. [2018-01-24 17:29:32,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:29:32,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-24 17:29:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:29:32,844 INFO L225 Difference]: With dead ends: 233 [2018-01-24 17:29:32,845 INFO L226 Difference]: Without dead ends: 170 [2018-01-24 17:29:32,845 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:29:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-24 17:29:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-01-24 17:29:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-24 17:29:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 189 transitions. [2018-01-24 17:29:32,859 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 189 transitions. Word has length 24 [2018-01-24 17:29:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:29:32,859 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 189 transitions. [2018-01-24 17:29:32,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:29:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2018-01-24 17:29:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 17:29:32,861 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:29:32,861 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] [2018-01-24 17:29:32,861 INFO L371 AbstractCegarLoop]: === Iteration 11 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-24 17:29:32,861 INFO L82 PathProgramCache]: Analyzing trace with hash 560220083, now seen corresponding path program 1 times [2018-01-24 17:29:32,861 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:29:32,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:32,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:29:32,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:32,862 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:29:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:29:32,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:29:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:29:32,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:29:32,906 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:29:32,907 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 17:29:32,908 INFO L201 CegarAbsIntRunner]: [0], [1], [4], [7], [11], [15], [17], [18], [19], [24], [25], [28], [31], [36], [65], [69], [71], [123], [124], [172], [188], [189], [190] [2018-01-24 17:29:32,952 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:29:32,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:29:33,243 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 17:29:33,244 INFO L268 AbstractInterpreter]: Visited 23 different actions 36 times. Merged at 10 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 17:29:33,251 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 17:29:33,438 INFO L232 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 59.45% of their original sizes. [2018-01-24 17:29:33,438 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 17:29:33,782 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 17:29:33,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:29:33,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [5] total 19 [2018-01-24 17:29:33,783 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:29:33,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 17:29:33,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 17:29:33,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-01-24 17:29:33,784 INFO L87 Difference]: Start difference. First operand 157 states and 189 transitions. Second operand 16 states. [2018-01-24 17:29:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:29:49,120 INFO L93 Difference]: Finished difference Result 309 states and 377 transitions. [2018-01-24 17:29:49,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 17:29:49,152 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2018-01-24 17:29:49,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:29:49,153 INFO L225 Difference]: With dead ends: 309 [2018-01-24 17:29:49,154 INFO L226 Difference]: Without dead ends: 184 [2018-01-24 17:29:49,155 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 17:29:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-24 17:29:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 162. [2018-01-24 17:29:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 17:29:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions. [2018-01-24 17:29:49,187 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 24 [2018-01-24 17:29:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:29:49,187 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions. [2018-01-24 17:29:49,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 17:29:49,188 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions. [2018-01-24 17:29:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 17:29:49,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:29:49,189 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] [2018-01-24 17:29:49,189 INFO L371 AbstractCegarLoop]: === Iteration 12 === [re_insertErr7RequiresViolation, re_insertErr5RequiresViolation, re_insertErr2RequiresViolation, re_insertErr3RequiresViolation, re_insertErr9RequiresViolation, re_insertErr6RequiresViolation, re_insertErr8RequiresViolation, re_insertErr4RequiresViolation, re_insertErr11RequiresViolation, re_insertErr0RequiresViolation, re_insertErr1RequiresViolation, re_insertErr10RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation, is_list_containing_xErr1RequiresViolation, is_list_containing_xErr0RequiresViolation, is_list_containing_xErr2RequiresViolation, is_list_containing_xErr3RequiresViolation, removeErr9RequiresViolation, removeErr13RequiresViolation, removeErr0RequiresViolation, removeErr4RequiresViolation, removeErr5RequiresViolation, removeErr12RequiresViolation, removeErr10RequiresViolation, removeErr6RequiresViolation, removeErr14RequiresViolation, removeErr3RequiresViolation, removeErr1RequiresViolation, removeErr8RequiresViolation, removeErr11RequiresViolation, removeErr7RequiresViolation, removeErr15RequiresViolation, removeErr2RequiresViolation]=== [2018-01-24 17:29:49,189 INFO L82 PathProgramCache]: Analyzing trace with hash 560220084, now seen corresponding path program 1 times [2018-01-24 17:29:49,189 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:29:49,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:49,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:29:49,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:29:49,191 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:29:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:29:49,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:29:49,246 ERROR L119 erpolLogProxyWrapper]: Interpolant 16 not inductive: (Check returned sat) [2018-01-24 17:29:49,260 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 17:29:49,263 INFO L168 Benchmark]: Toolchain (without parser) took 20429.61 ms. Allocated memory was 309.3 MB in the beginning and 1.2 GB in the end (delta: 923.3 MB). Free memory was 268.4 MB in the beginning and 1.1 GB in the end (delta: -880.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:29:49,264 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 309.3 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:29:49,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.20 ms. Allocated memory is still 309.3 MB. Free memory was 268.4 MB in the beginning and 256.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:29:49,265 INFO L168 Benchmark]: Boogie Preprocessor took 51.88 ms. Allocated memory is still 309.3 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:29:49,265 INFO L168 Benchmark]: RCFGBuilder took 462.49 ms. Allocated memory is still 309.3 MB. Free memory was 254.4 MB in the beginning and 223.9 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. [2018-01-24 17:29:49,266 INFO L168 Benchmark]: TraceAbstraction took 19613.38 ms. Allocated memory was 309.3 MB in the beginning and 1.2 GB in the end (delta: 923.3 MB). Free memory was 223.9 MB in the beginning and 1.1 GB in the end (delta: -925.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:29:49,268 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.21 ms. Allocated memory is still 309.3 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 292.20 ms. Allocated memory is still 309.3 MB. Free memory was 268.4 MB in the beginning and 256.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.88 ms. Allocated memory is still 309.3 MB. Free memory was 256.4 MB in the beginning and 254.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 462.49 ms. Allocated memory is still 309.3 MB. Free memory was 254.4 MB in the beginning and 223.9 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 19613.38 ms. Allocated memory was 309.3 MB in the beginning and 1.2 GB in the end (delta: 923.3 MB). Free memory was 223.9 MB in the beginning and 1.1 GB in the end (delta: -925.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 215 LocStat_NO_SUPPORTING_DISEQUALITIES : 82 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.862890 RENAME_VARIABLES(MILLISECONDS) : 0.333050 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.820986 PROJECTAWAY(MILLISECONDS) : 0.468582 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001716 DISJOIN(MILLISECONDS) : 0.908447 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.361747 ADD_EQUALITY(MILLISECONDS) : 0.034832 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.047391 #CONJOIN_DISJUNCTIVE : 68 #RENAME_VARIABLES : 125 #UNFREEZE : 0 #CONJOIN : 137 #PROJECTAWAY : 85 #ADD_WEAK_EQUALITY : 25 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 119 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-29-49-281.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-29-49-281.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-29-49-281.csv Received shutdown request...