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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:28:02,492 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:28:02,493 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:28:02,509 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:28:02,509 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:28:02,510 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:28:02,515 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:28:02,517 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:28:02,518 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:28:02,519 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:28:02,519 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:28:02,520 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:28:02,521 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:28:02,522 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:28:02,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:28:02,525 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:28:02,526 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:28:02,528 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:28:02,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:28:02,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:28:02,532 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:28:02,532 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:28:02,532 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:28:02,533 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:28:02,533 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:28:02,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:28:02,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:28:02,535 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:28:02,535 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:28:02,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:28:02,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:28:02,536 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:28:02,554 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:28:02,554 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:28:02,557 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:28:02,557 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:28:02,557 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:28:02,557 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:28:02,558 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:28:02,558 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:28:02,558 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:28:02,558 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:28:02,558 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:28:02,558 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:28:02,559 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:28:02,559 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:28:02,559 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:28:02,559 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:28:02,559 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:28:02,559 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:28:02,560 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:28:02,560 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:28:02,560 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:28:02,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:28:02,560 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:28:02,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:28:02,603 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:28:02,606 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:28:02,607 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:28:02,608 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:28:02,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i [2018-02-04 03:28:02,796 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:28:02,797 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:28:02,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:28:02,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:28:02,804 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:28:02,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:28:02" (1/1) ... [2018-02-04 03:28:02,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e6fee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:02, skipping insertion in model container [2018-02-04 03:28:02,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:28:02" (1/1) ... [2018-02-04 03:28:02,824 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:28:02,858 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:28:02,960 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:28:02,980 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:28:03,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:02 WrapperNode [2018-02-04 03:28:03,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:28:03,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:28:03,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:28:03,004 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:28:03,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:02" (1/1) ... [2018-02-04 03:28:03,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:02" (1/1) ... [2018-02-04 03:28:03,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:02" (1/1) ... [2018-02-04 03:28:03,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:02" (1/1) ... [2018-02-04 03:28:03,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:02" (1/1) ... [2018-02-04 03:28:03,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:02" (1/1) ... [2018-02-04 03:28:03,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:02" (1/1) ... [2018-02-04 03:28:03,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:28:03,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:28:03,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:28:03,033 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:28:03,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:02" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 03:28:03,077 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:28:03,077 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:28:03,077 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-02-04 03:28:03,078 INFO L136 BoogieDeclarations]: Found implementation of procedure remove [2018-02-04 03:28:03,078 INFO L136 BoogieDeclarations]: Found implementation of procedure re_insert [2018-02-04 03:28:03,078 INFO L136 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2018-02-04 03:28:03,078 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:28:03,078 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:28:03,079 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:28:03,079 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:28:03,079 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:28:03,079 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:28:03,079 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-02-04 03:28:03,079 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-02-04 03:28:03,079 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 03:28:03,080 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-02-04 03:28:03,080 INFO L128 BoogieDeclarations]: Found specification of procedure remove [2018-02-04 03:28:03,080 INFO L128 BoogieDeclarations]: Found specification of procedure re_insert [2018-02-04 03:28:03,080 INFO L128 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2018-02-04 03:28:03,080 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:28:03,080 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:28:03,080 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:28:03,519 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:28:03,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:28:03 BoogieIcfgContainer [2018-02-04 03:28:03,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:28:03,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:28:03,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:28:03,524 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:28:03,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:28:02" (1/3) ... [2018-02-04 03:28:03,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223b5a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:28:03, skipping insertion in model container [2018-02-04 03:28:03,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:28:02" (2/3) ... [2018-02-04 03:28:03,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223b5a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:28:03, skipping insertion in model container [2018-02-04 03:28:03,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:28:03" (3/3) ... [2018-02-04 03:28:03,527 INFO L107 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2018-02-04 03:28:03,532 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:28:03,537 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-04 03:28:03,567 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:28:03,567 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:28:03,567 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:28:03,567 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:28:03,567 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:28:03,568 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:28:03,568 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:28:03,568 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:28:03,568 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:28:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-02-04 03:28:03,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 03:28:03,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:03,588 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:03,588 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-02-04 03:28:03,592 INFO L82 PathProgramCache]: Analyzing trace with hash 436525791, now seen corresponding path program 1 times [2018-02-04 03:28:03,631 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:03,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:03,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:03,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:28:03,720 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:03,721 INFO L182 omatonBuilderFactory]: Interpolants [125#true, 126#false, 127#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-04 03:28:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:03,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:28:03,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:28:03,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:28:03,738 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2018-02-04 03:28:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:03,910 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-04 03:28:03,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:28:03,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 03:28:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:03,918 INFO L225 Difference]: With dead ends: 120 [2018-02-04 03:28:03,918 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 03:28:03,919 INFO L554 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-02-04 03:28:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 03:28:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-02-04 03:28:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 03:28:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-02-04 03:28:03,947 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 7 [2018-02-04 03:28:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:03,947 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-02-04 03:28:03,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:28:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-02-04 03:28:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 03:28:03,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:03,948 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:03,948 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-02-04 03:28:03,948 INFO L82 PathProgramCache]: Analyzing trace with hash 436525792, now seen corresponding path program 1 times [2018-02-04 03:28:03,948 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:03,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:03,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:03,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:28:03,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:03,990 INFO L182 omatonBuilderFactory]: Interpolants [364#true, 365#false, 366#(and (= (select |#length| |main_~#list~0.base|) 8) (= |main_~#list~0.offset| 0))] [2018-02-04 03:28:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:03,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:28:03,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:28:03,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:28:03,992 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 3 states. [2018-02-04 03:28:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:04,082 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2018-02-04 03:28:04,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:28:04,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 03:28:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:04,084 INFO L225 Difference]: With dead ends: 114 [2018-02-04 03:28:04,084 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 03:28:04,085 INFO L554 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-02-04 03:28:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 03:28:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 03:28:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 03:28:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2018-02-04 03:28:04,093 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 7 [2018-02-04 03:28:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:04,093 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2018-02-04 03:28:04,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:28:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2018-02-04 03:28:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 03:28:04,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:04,094 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:04,094 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-02-04 03:28:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash -711243012, now seen corresponding path program 1 times [2018-02-04 03:28:04,095 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:04,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:04,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:04,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:04,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:04,148 INFO L182 omatonBuilderFactory]: Interpolants [595#true, 596#false, 597#(and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset)), 598#(and (= |is_list_containing_x_#in~x.base| |is_list_containing_x_#in~l.base|) (= |is_list_containing_x_#in~l.offset| |is_list_containing_x_#in~x.offset|)), 599#(and (= is_list_containing_x_~x.offset is_list_containing_x_~l.offset) (= is_list_containing_x_~l.base is_list_containing_x_~x.base))] [2018-02-04 03:28:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:04,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:28:04,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:28:04,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:28:04,149 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand 5 states. [2018-02-04 03:28:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:04,202 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2018-02-04 03:28:04,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:28:04,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 03:28:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:04,205 INFO L225 Difference]: With dead ends: 150 [2018-02-04 03:28:04,206 INFO L226 Difference]: Without dead ends: 150 [2018-02-04 03:28:04,206 INFO L554 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-02-04 03:28:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-04 03:28:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-02-04 03:28:04,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-04 03:28:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2018-02-04 03:28:04,218 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 15 [2018-02-04 03:28:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:04,218 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2018-02-04 03:28:04,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:28:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2018-02-04 03:28:04,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 03:28:04,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:04,219 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:04,219 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-02-04 03:28:04,220 INFO L82 PathProgramCache]: Analyzing trace with hash -714029430, now seen corresponding path program 1 times [2018-02-04 03:28:04,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:04,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:04,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:04,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:04,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:04,260 INFO L182 omatonBuilderFactory]: Interpolants [890#true, 891#false, 892#(= 1 (select |#valid| |main_#t~malloc21.base|)), 893#(= 1 (select |#valid| main_~n~0.base))] [2018-02-04 03:28:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:04,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:04,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:04,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:04,261 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand 4 states. [2018-02-04 03:28:04,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:04,607 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2018-02-04 03:28:04,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:28:04,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 03:28:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:04,609 INFO L225 Difference]: With dead ends: 154 [2018-02-04 03:28:04,609 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 03:28:04,609 INFO L554 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-02-04 03:28:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 03:28:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2018-02-04 03:28:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 03:28:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2018-02-04 03:28:04,615 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 15 [2018-02-04 03:28:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:04,615 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2018-02-04 03:28:04,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2018-02-04 03:28:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 03:28:04,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:04,616 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:04,616 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-02-04 03:28:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash -714029429, now seen corresponding path program 1 times [2018-02-04 03:28:04,616 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:04,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:04,679 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:04,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:04,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:04,679 INFO L182 omatonBuilderFactory]: Interpolants [1187#true, 1188#false, 1189#(and (= 0 |main_#t~malloc21.offset|) (= 8 (select |#length| |main_#t~malloc21.base|))), 1190#(and (= main_~n~0.offset 0) (= (select |#length| main_~n~0.base) 8))] [2018-02-04 03:28:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:04,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:04,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:04,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:04,680 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 4 states. [2018-02-04 03:28:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:04,789 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2018-02-04 03:28:04,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:28:04,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 03:28:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:04,790 INFO L225 Difference]: With dead ends: 155 [2018-02-04 03:28:04,790 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 03:28:04,790 INFO L554 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-02-04 03:28:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 03:28:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2018-02-04 03:28:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 03:28:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2018-02-04 03:28:04,800 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 15 [2018-02-04 03:28:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:04,800 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2018-02-04 03:28:04,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2018-02-04 03:28:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:28:04,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:04,801 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:04,801 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-02-04 03:28:04,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485069, now seen corresponding path program 1 times [2018-02-04 03:28:04,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:04,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:04,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:04,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:28:04,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:04,857 INFO L182 omatonBuilderFactory]: Interpolants [1488#(or (= 1 (select |#valid| main_~tail~0.base)) (= main_~tail~0.base main_~n~0.base)), 1489#(and (= (select |#valid| main_~n~0.base) 1) (= 1 (select |#valid| main_~tail~0.base))), 1483#true, 1484#false, 1485#(= 1 (select |#valid| |main_~#list~0.base|)), 1486#(= 1 (select |#valid| main_~tail~0.base)), 1487#(or (= main_~tail~0.base |main_#t~malloc21.base|) (= 1 (select |#valid| main_~tail~0.base)))] [2018-02-04 03:28:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:04,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:28:04,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:28:04,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:28:04,858 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand 7 states. [2018-02-04 03:28:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:05,029 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2018-02-04 03:28:05,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:28:05,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 03:28:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:05,030 INFO L225 Difference]: With dead ends: 162 [2018-02-04 03:28:05,030 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 03:28:05,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:05,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 03:28:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 133. [2018-02-04 03:28:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 03:28:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2018-02-04 03:28:05,038 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 17 [2018-02-04 03:28:05,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:05,038 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2018-02-04 03:28:05,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:28:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2018-02-04 03:28:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:28:05,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:05,039 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:05,039 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-02-04 03:28:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1012485070, now seen corresponding path program 1 times [2018-02-04 03:28:05,040 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:05,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:05,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:05,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:05,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:05,135 INFO L182 omatonBuilderFactory]: Interpolants [1792#(and (= main_~tail~0.offset 0) (<= 8 (select |#length| main_~tail~0.base))), 1789#true, 1790#false, 1791#(and (= (select |#length| |main_~#list~0.base|) 8) (= 0 |main_~#list~0.offset|))] [2018-02-04 03:28:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:05,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:05,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:05,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:05,136 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand 4 states. [2018-02-04 03:28:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:05,234 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2018-02-04 03:28:05,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:28:05,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 03:28:05,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:05,236 INFO L225 Difference]: With dead ends: 132 [2018-02-04 03:28:05,236 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 03:28:05,236 INFO L554 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-02-04 03:28:05,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 03:28:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-02-04 03:28:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 03:28:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 154 transitions. [2018-02-04 03:28:05,241 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 154 transitions. Word has length 17 [2018-02-04 03:28:05,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:05,241 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 154 transitions. [2018-02-04 03:28:05,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 154 transitions. [2018-02-04 03:28:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 03:28:05,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:05,242 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:05,242 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-02-04 03:28:05,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937321, now seen corresponding path program 1 times [2018-02-04 03:28:05,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:05,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:05,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:05,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:05,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:05,286 INFO L182 omatonBuilderFactory]: Interpolants [2064#(= 1 (select |#valid| remove_~x.base)), 2059#true, 2060#false, 2061#(= 1 (select |#valid| |main_~#list~0.base|)), 2062#(= 1 (select |#valid| main_~x~0.base)), 2063#(= 1 (select |#valid| |remove_#in~x.base|))] [2018-02-04 03:28:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:05,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:28:05,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:28:05,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:28:05,287 INFO L87 Difference]: Start difference. First operand 132 states and 154 transitions. Second operand 6 states. [2018-02-04 03:28:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:05,460 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2018-02-04 03:28:05,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:28:05,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 03:28:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:05,461 INFO L225 Difference]: With dead ends: 155 [2018-02-04 03:28:05,461 INFO L226 Difference]: Without dead ends: 155 [2018-02-04 03:28:05,461 INFO L554 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-02-04 03:28:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-04 03:28:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2018-02-04 03:28:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 03:28:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 175 transitions. [2018-02-04 03:28:05,466 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 175 transitions. Word has length 20 [2018-02-04 03:28:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:05,466 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 175 transitions. [2018-02-04 03:28:05,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:28:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2018-02-04 03:28:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 03:28:05,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:05,467 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:05,467 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-02-04 03:28:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1331937322, now seen corresponding path program 1 times [2018-02-04 03:28:05,467 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:05,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:05,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:05,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:05,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:05,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-02-04 03:28:05,530 INFO L182 omatonBuilderFactory]: Interpolants [2368#(and (= 8 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|)), 2369#(and (= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 2370#(and (= 0 |remove_#in~x.offset|) (= 8 (select |#length| |remove_#in~x.base|))), 2371#(and (= remove_~x.offset 0) (= (select |#length| remove_~x.base) 8)), 2366#true, 2367#false] [2018-02-04 03:28:05,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-02-04 03:28:05,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:28:05,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:28:05,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:28:05,531 INFO L87 Difference]: Start difference. First operand 142 states and 175 transitions. Second operand 6 states. [2018-02-04 03:28:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:05,760 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2018-02-04 03:28:05,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:28:05,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 03:28:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:05,761 INFO L225 Difference]: With dead ends: 152 [2018-02-04 03:28:05,761 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 03:28:05,761 INFO L554 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-02-04 03:28:05,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 03:28:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2018-02-04 03:28:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 03:28:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 169 transitions. [2018-02-04 03:28:05,765 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 169 transitions. Word has length 20 [2018-02-04 03:28:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:05,765 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 169 transitions. [2018-02-04 03:28:05,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:28:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 169 transitions. [2018-02-04 03:28:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:28:05,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:05,768 INFO L351 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-02-04 03:28:05,768 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-02-04 03:28:05,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2044804781, now seen corresponding path program 1 times [2018-02-04 03:28:05,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:05,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:05,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:05,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:28:05,894 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:05,894 INFO L182 omatonBuilderFactory]: Interpolants [2672#(= |main_~#list~0.offset| 0), 2673#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= |main_~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))), 2674#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 2675#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4))) (= 0 main_~x~0.offset)), 2676#(and (= 0 |remove_#in~x.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) (+ 0 4)))), 2677#(and (= remove_~x.offset 0) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)))), 2678#(and (= |remove_#t~mem1.offset| 0) (= |remove_#t~mem1.base| (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= remove_~x.offset 0) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)))), 2670#true, 2671#false] [2018-02-04 03:28:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:05,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:28:05,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:28:05,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:05,895 INFO L87 Difference]: Start difference. First operand 142 states and 169 transitions. Second operand 9 states. [2018-02-04 03:28:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:06,098 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2018-02-04 03:28:06,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:28:06,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 03:28:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:06,099 INFO L225 Difference]: With dead ends: 170 [2018-02-04 03:28:06,099 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 03:28:06,100 INFO L554 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-02-04 03:28:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 03:28:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2018-02-04 03:28:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 03:28:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 189 transitions. [2018-02-04 03:28:06,104 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 189 transitions. Word has length 24 [2018-02-04 03:28:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:06,105 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 189 transitions. [2018-02-04 03:28:06,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:28:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2018-02-04 03:28:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:28:06,105 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:06,106 INFO L351 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-02-04 03:28:06,106 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-02-04 03:28:06,106 INFO L82 PathProgramCache]: Analyzing trace with hash 560220083, now seen corresponding path program 1 times [2018-02-04 03:28:06,107 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:06,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:06,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:06,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:28:06,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:06,151 INFO L182 omatonBuilderFactory]: Interpolants [3012#true, 3013#false, 3014#(= main_~tail~0.base |main_~#list~0.base|), 3015#(= 1 (select |#valid| |main_~#list~0.base|)), 3016#(= 1 (select |#valid| |is_list_containing_x_#in~l.base|)), 3017#(= 1 (select |#valid| is_list_containing_x_~l.base))] [2018-02-04 03:28:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:06,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:28:06,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:28:06,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:28:06,152 INFO L87 Difference]: Start difference. First operand 157 states and 189 transitions. Second operand 6 states. [2018-02-04 03:28:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:06,283 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2018-02-04 03:28:06,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:28:06,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 03:28:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:06,284 INFO L225 Difference]: With dead ends: 169 [2018-02-04 03:28:06,285 INFO L226 Difference]: Without dead ends: 169 [2018-02-04 03:28:06,285 INFO L554 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-02-04 03:28:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-04 03:28:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-02-04 03:28:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 03:28:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2018-02-04 03:28:06,289 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 24 [2018-02-04 03:28:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:06,289 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2018-02-04 03:28:06,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:28:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2018-02-04 03:28:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 03:28:06,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:06,290 INFO L351 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-02-04 03:28:06,290 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-02-04 03:28:06,290 INFO L82 PathProgramCache]: Analyzing trace with hash 560220084, now seen corresponding path program 1 times [2018-02-04 03:28:06,290 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:06,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:06,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:06,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:28:06,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:06,448 INFO L182 omatonBuilderFactory]: Interpolants [3360#(and (or (and (= main_~tail~0.base |main_~#list~0.base|) (= 8 (select |#length| main_~tail~0.base))) (and (= |main_~#list~0.base| |main_#t~malloc21.base|) (= |main_~#list~0.offset| |main_#t~malloc21.offset|))) (= 0 |main_~#list~0.offset|)), 3361#(and (or (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset)) (and (= main_~tail~0.base |main_~#list~0.base|) (= 8 (select |#length| main_~tail~0.base)))) (= 0 |main_~#list~0.offset|)), 3362#(and (or (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset)) (= 8 (select |#length| |main_~#list~0.base|))) (= 0 |main_~#list~0.offset|)), 3363#(and (or (= 8 (select |#length| |main_~#list~0.base|)) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))) (= 0 |main_~#list~0.offset|)), 3364#(and (= 0 |is_list_containing_x_#in~l.offset|) (or (= 8 (select |#length| |is_list_containing_x_#in~l.base|)) (and (= |is_list_containing_x_#in~x.base| |is_list_containing_x_#in~l.base|) (= |is_list_containing_x_#in~l.offset| |is_list_containing_x_#in~x.offset|)))), 3365#(and (or (= (select |#length| is_list_containing_x_~l.base) 8) (and (= is_list_containing_x_~x.offset is_list_containing_x_~l.offset) (= is_list_containing_x_~l.base is_list_containing_x_~x.base))) (= is_list_containing_x_~l.offset 0)), 3366#(and (= (select |#length| is_list_containing_x_~l.base) 8) (= is_list_containing_x_~l.offset 0)), 3356#true, 3357#false, 3358#(and (= 8 (select |#length| |main_~#list~0.base|)) (= |main_~#list~0.offset| 0)), 3359#(and (= main_~tail~0.base |main_~#list~0.base|) (= 8 (select |#length| |main_~#list~0.base|)) (= |main_~#list~0.offset| 0))] [2018-02-04 03:28:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:06,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:28:06,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:28:06,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:28:06,449 INFO L87 Difference]: Start difference. First operand 165 states and 201 transitions. Second operand 11 states. [2018-02-04 03:28:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:06,663 INFO L93 Difference]: Finished difference Result 167 states and 203 transitions. [2018-02-04 03:28:06,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:28:06,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-02-04 03:28:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:06,664 INFO L225 Difference]: With dead ends: 167 [2018-02-04 03:28:06,664 INFO L226 Difference]: Without dead ends: 167 [2018-02-04 03:28:06,665 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:28:06,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-04 03:28:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-02-04 03:28:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 03:28:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 199 transitions. [2018-02-04 03:28:06,668 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 199 transitions. Word has length 24 [2018-02-04 03:28:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:06,668 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 199 transitions. [2018-02-04 03:28:06,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:28:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 199 transitions. [2018-02-04 03:28:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 03:28:06,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:06,669 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:06,669 INFO L371 AbstractCegarLoop]: === Iteration 13 === [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-02-04 03:28:06,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1681609457, now seen corresponding path program 1 times [2018-02-04 03:28:06,669 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:06,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:06,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:06,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:28:06,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:06,737 INFO L182 omatonBuilderFactory]: Interpolants [3703#true, 3704#false, 3705#(and (= 0 (select (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4) 0) |main_~#list~0.offset|)) (= 0 (select (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4) 0) |main_~#list~0.offset|))), 3706#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| main_~x~0.base) (= |main_~#list~0.offset| main_~x~0.offset)), 3707#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3708#(and (= 0 (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) |remove_#in~x.offset|))), 3709#(and (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) remove_~x.offset)) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) remove_~x.offset))), 3710#(and (= |remove_#t~mem5.base| 0) (= 0 |remove_#t~mem5.offset|))] [2018-02-04 03:28:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:06,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:28:06,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:28:06,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:28:06,738 INFO L87 Difference]: Start difference. First operand 165 states and 199 transitions. Second operand 8 states. [2018-02-04 03:28:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:06,898 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2018-02-04 03:28:06,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:28:06,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-02-04 03:28:06,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:06,902 INFO L225 Difference]: With dead ends: 173 [2018-02-04 03:28:06,902 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 03:28:06,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:28:06,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 03:28:06,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 165. [2018-02-04 03:28:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 03:28:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 197 transitions. [2018-02-04 03:28:06,911 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 197 transitions. Word has length 26 [2018-02-04 03:28:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:06,911 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 197 transitions. [2018-02-04 03:28:06,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:28:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2018-02-04 03:28:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 03:28:06,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:06,912 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:06,912 INFO L371 AbstractCegarLoop]: === Iteration 14 === [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-02-04 03:28:06,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1579097554, now seen corresponding path program 1 times [2018-02-04 03:28:06,913 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:06,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:06,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:06,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:28:06,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:06,972 INFO L182 omatonBuilderFactory]: Interpolants [4053#true, 4054#false, 4055#(= 1 (select |#valid| |main_~#list~0.base|)), 4056#(not (= |main_~#list~0.base| |main_#t~malloc21.base|)), 4057#(not (= |main_~#list~0.base| main_~n~0.base)), 4058#(not (= |main_~#list~0.base| main_~x~0.base)), 4059#(and (= |is_list_containing_x_#in~x.base| is_list_containing_x_~x.base) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|)), 4060#(= |is_list_containing_x_#in~x.base| |is_list_containing_x_#in~l.base|)] [2018-02-04 03:28:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:06,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:28:06,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:28:06,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:28:06,973 INFO L87 Difference]: Start difference. First operand 165 states and 197 transitions. Second operand 8 states. [2018-02-04 03:28:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:07,224 INFO L93 Difference]: Finished difference Result 188 states and 229 transitions. [2018-02-04 03:28:07,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:07,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-02-04 03:28:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:07,225 INFO L225 Difference]: With dead ends: 188 [2018-02-04 03:28:07,226 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 03:28:07,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:28:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 03:28:07,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2018-02-04 03:28:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-04 03:28:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 196 transitions. [2018-02-04 03:28:07,231 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 196 transitions. Word has length 29 [2018-02-04 03:28:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:07,231 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 196 transitions. [2018-02-04 03:28:07,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:28:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 196 transitions. [2018-02-04 03:28:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 03:28:07,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:07,232 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:07,232 INFO L371 AbstractCegarLoop]: === Iteration 15 === [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-02-04 03:28:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1385679684, now seen corresponding path program 1 times [2018-02-04 03:28:07,233 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:07,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:07,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:07,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:28:07,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:07,375 INFO L182 omatonBuilderFactory]: Interpolants [4432#(and (= 0 |is_list_containing_x_#in~l.offset|) (= (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) (+ 0 4)) |is_list_containing_x_#in~x.offset|) (= |is_list_containing_x_#in~x.base| (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) (+ 0 4)))), 4433#(and (= (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)) is_list_containing_x_~x.offset) (= is_list_containing_x_~l.offset 0) (= is_list_containing_x_~x.base (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)))), 4434#(and (= is_list_containing_x_~x.base |is_list_containing_x_#t~mem16.base|) (= |is_list_containing_x_#t~mem16.offset| is_list_containing_x_~x.offset)), 4435#(and (= |is_list_containing_x_#in~x.base| |is_list_containing_x_#in~l.base|) (= |is_list_containing_x_#in~l.offset| |is_list_containing_x_#in~x.offset|)), 4436#(and (= is_list_containing_x_~x.offset is_list_containing_x_~l.offset) (= is_list_containing_x_~l.base is_list_containing_x_~x.base)), 4426#true, 4427#false, 4428#(= |main_~#list~0.offset| 0), 4429#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= |main_~#list~0.offset| 0)), 4430#(and (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)) main_~n~0.offset) (= main_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= |main_~#list~0.offset| 0)), 4431#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)) main_~x~0.offset) (= |main_~#list~0.offset| 0))] [2018-02-04 03:28:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:07,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:28:07,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:28:07,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:28:07,376 INFO L87 Difference]: Start difference. First operand 165 states and 196 transitions. Second operand 11 states. [2018-02-04 03:28:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:07,598 INFO L93 Difference]: Finished difference Result 198 states and 240 transitions. [2018-02-04 03:28:07,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:28:07,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-02-04 03:28:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:07,600 INFO L225 Difference]: With dead ends: 198 [2018-02-04 03:28:07,600 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 03:28:07,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:28:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 03:28:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 184. [2018-02-04 03:28:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-04 03:28:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2018-02-04 03:28:07,605 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 30 [2018-02-04 03:28:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:07,605 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2018-02-04 03:28:07,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:28:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2018-02-04 03:28:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 03:28:07,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:07,606 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:07,606 INFO L371 AbstractCegarLoop]: === Iteration 16 === [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-02-04 03:28:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1182902430, now seen corresponding path program 1 times [2018-02-04 03:28:07,607 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:07,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:07,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:07,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:07,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:07,669 INFO L182 omatonBuilderFactory]: Interpolants [4832#false, 4833#(= (select |#valid| main_~n~0.base) 1), 4834#(= 1 (select |#valid| main_~x~0.base)), 4835#(= 1 (select |#valid| |remove_#in~x.base|)), 4836#(= 1 (select |#valid| remove_~x.base)), 4831#true] [2018-02-04 03:28:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:07,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:28:07,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:28:07,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:28:07,670 INFO L87 Difference]: Start difference. First operand 184 states and 218 transitions. Second operand 6 states. [2018-02-04 03:28:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:07,872 INFO L93 Difference]: Finished difference Result 219 states and 267 transitions. [2018-02-04 03:28:07,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:28:07,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 03:28:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:07,875 INFO L225 Difference]: With dead ends: 219 [2018-02-04 03:28:07,875 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 03:28:07,875 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:28:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 03:28:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 183. [2018-02-04 03:28:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-04 03:28:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2018-02-04 03:28:07,886 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 31 [2018-02-04 03:28:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:07,886 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2018-02-04 03:28:07,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:28:07,887 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2018-02-04 03:28:07,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 03:28:07,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:07,888 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:07,888 INFO L371 AbstractCegarLoop]: === Iteration 17 === [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-02-04 03:28:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1182902431, now seen corresponding path program 1 times [2018-02-04 03:28:07,888 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:07,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:28:07,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:07,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:28:07,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:07,946 INFO L182 omatonBuilderFactory]: Interpolants [5244#true, 5245#false, 5246#(= 0 |is_list_containing_x_#res|), 5247#(= |main_#t~ret26| 0)] [2018-02-04 03:28:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:28:07,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:07,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:07,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:07,947 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand 4 states. [2018-02-04 03:28:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:07,952 INFO L93 Difference]: Finished difference Result 190 states and 226 transitions. [2018-02-04 03:28:07,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:28:07,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-04 03:28:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:07,960 INFO L225 Difference]: With dead ends: 190 [2018-02-04 03:28:07,960 INFO L226 Difference]: Without dead ends: 187 [2018-02-04 03:28:07,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-04 03:28:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-02-04 03:28:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 03:28:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 219 transitions. [2018-02-04 03:28:07,969 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 219 transitions. Word has length 31 [2018-02-04 03:28:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:07,970 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 219 transitions. [2018-02-04 03:28:07,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 219 transitions. [2018-02-04 03:28:07,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 03:28:07,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:07,971 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:07,971 INFO L371 AbstractCegarLoop]: === Iteration 18 === [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-02-04 03:28:07,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1642636396, now seen corresponding path program 1 times [2018-02-04 03:28:07,972 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:07,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:08,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:08,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:28:08,421 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:08,421 INFO L182 omatonBuilderFactory]: Interpolants [5632#(and (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= 0 (select (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base) (+ |main_~#list~0.offset| 4))) (= main_~tail~0.base main_~x~0.base) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.offset) (+ |main_~#list~0.offset| 4))))) (not (= |main_~#list~0.base| main_~n~0.base)) (= |main_~#list~0.offset| 0) (or (not (= |main_~#list~0.offset| main_~tail~0.offset)) (and (= main_~tail~0.base main_~x~0.base) (= 1 (select |#valid| main_~n~0.base)))) (= 0 main_~x~0.offset)), 5633#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4))))) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 5634#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4))))) (= 0 main_~x~0.offset)), 5635#(and (= 0 |remove_#in~x.offset|) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) (+ 0 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) (+ 0 4)))))), 5636#(and (= remove_~x.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)))))), 5637#(and (= remove_~x.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)))) (and (= |remove_#t~mem1.offset| 0) (= 0 |remove_#t~mem1.base|)))), 5638#(and (= remove_~x.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))))), 5639#(and (= remove_~x.offset 0) (= 1 (select |#valid| |remove_#t~mem2.base|))), 5640#(= 1 (select |#valid| |remove_#t~mem2.base|)), 5623#true, 5624#false, 5625#(= |main_~#list~0.offset| 0), 5626#(and (= |main_~#list~0.offset| 0) (= 1 (select |#valid| |main_~#list~0.base|))), 5627#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= (select |#valid| |main_~#list~0.base|) 1) (= |main_~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))), 5628#(and (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= main_~tail~0.base |main_~#list~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (= main_~tail~0.base main_~x~0.base) (= (select |#valid| |main_~#list~0.base|) 1) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 5629#(and (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= main_~tail~0.base |main_~#list~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (not (= |main_~#list~0.base| |main_#t~malloc21.base|)) (= main_~tail~0.base main_~x~0.base) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 5630#(and (= main_~tail~0.base main_~x~0.base) (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= main_~tail~0.base |main_~#list~0.base|) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset main_~tail~0.offset)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset main_~tail~0.base)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (not (= |main_~#list~0.base| main_~n~0.base)) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 5631#(and (= (select |#valid| main_~n~0.base) 1) (= main_~tail~0.base main_~x~0.base) (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= main_~tail~0.base |main_~#list~0.base|) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) 0)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (not (= |main_~#list~0.base| main_~n~0.base)) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset))] [2018-02-04 03:28:08,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:08,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:28:08,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:28:08,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:28:08,421 INFO L87 Difference]: Start difference. First operand 185 states and 219 transitions. Second operand 18 states. [2018-02-04 03:28:09,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:09,379 INFO L93 Difference]: Finished difference Result 211 states and 253 transitions. [2018-02-04 03:28:09,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:28:09,380 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-02-04 03:28:09,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:09,381 INFO L225 Difference]: With dead ends: 211 [2018-02-04 03:28:09,382 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 03:28:09,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-02-04 03:28:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 03:28:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 185. [2018-02-04 03:28:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 03:28:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 218 transitions. [2018-02-04 03:28:09,387 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 218 transitions. Word has length 33 [2018-02-04 03:28:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:09,387 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 218 transitions. [2018-02-04 03:28:09,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:28:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 218 transitions. [2018-02-04 03:28:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 03:28:09,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:09,388 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:09,388 INFO L371 AbstractCegarLoop]: === Iteration 19 === [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-02-04 03:28:09,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1642636395, now seen corresponding path program 1 times [2018-02-04 03:28:09,389 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:09,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:09,863 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:09,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:28:09,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:09,864 INFO L182 omatonBuilderFactory]: Interpolants [6059#true, 6060#false, 6061#(= |main_~#list~0.offset| 0), 6062#(and (= |main_~#list~0.offset| 0) (= 1 (select |#valid| |main_~#list~0.base|))), 6063#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= (select |#valid| |main_~#list~0.base|) 1) (= |main_~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))), 6064#(and (= main_~tail~0.base |main_~#list~0.base|) (or (= |main_~#list~0.offset| main_~tail~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (= main_~tail~0.base main_~x~0.base) (or (= |main_~#list~0.offset| main_~tail~0.offset) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (= (select |#valid| |main_~#list~0.base|) 1) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 6065#(and (not (= |main_~#list~0.base| |main_#t~malloc21.base|)) (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= main_~tail~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (= main_~tail~0.base |main_~#list~0.base|) (or (= |main_~#list~0.offset| main_~tail~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (or (and (= 8 (select |#length| |main_#t~malloc21.base|)) (= main_~tail~0.base main_~x~0.base)) (not (= |main_~#list~0.offset| main_~tail~0.offset))) (or (= 0 |main_#t~malloc21.offset|) (not (= |main_~#list~0.offset| main_~tail~0.offset))) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 6066#(and (= main_~tail~0.base |main_~#list~0.base|) (or (= |main_~#list~0.offset| main_~tail~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset main_~tail~0.offset)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (or (= 0 main_~n~0.offset) (not (= |main_~#list~0.offset| main_~tail~0.offset))) (or (and (= main_~tail~0.base main_~x~0.base) (= 8 (select |#length| main_~n~0.base))) (not (= |main_~#list~0.offset| main_~tail~0.offset))) (not (= |main_~#list~0.base| main_~n~0.base)) (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= main_~tail~0.base main_~x~0.base) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset main_~tail~0.base)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 6067#(and (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= 0 (select (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base) (+ |main_~#list~0.offset| 4))) (= main_~tail~0.base main_~x~0.base))) (or (and (= main_~tail~0.base main_~x~0.base) (= 8 (select |#length| main_~n~0.base))) (not (= |main_~#list~0.offset| main_~tail~0.offset))) (not (= |main_~#list~0.base| main_~n~0.base)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.offset) (+ |main_~#list~0.offset| 4))) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 6068#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4))))) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 6069#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ 0 4))) (or (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4))))) (= 0 main_~x~0.offset)), 6070#(and (= 0 |remove_#in~x.offset|) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) (+ 0 4)))), 6071#(and (= remove_~x.offset 0) (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)))) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)))), 6072#(and (or (= 8 (select |#length| (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)))) (= 0 |remove_#t~mem1.base|)) (= |remove_#t~mem1.offset| 0) (= remove_~x.offset 0) (= |remove_#t~mem1.offset| (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)))), 6073#(and (= remove_~x.offset 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)))), 6074#(and (= remove_~x.offset 0) (= (select |#length| |remove_#t~mem2.base|) 8) (= |remove_#t~mem2.offset| 0)), 6075#(and (= (select |#length| |remove_#t~mem2.base|) 8) (= |remove_#t~mem2.offset| 0))] [2018-02-04 03:28:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:09,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:28:09,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:28:09,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:28:09,865 INFO L87 Difference]: Start difference. First operand 185 states and 218 transitions. Second operand 17 states. [2018-02-04 03:28:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:10,558 INFO L93 Difference]: Finished difference Result 211 states and 248 transitions. [2018-02-04 03:28:10,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:28:10,559 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2018-02-04 03:28:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:10,560 INFO L225 Difference]: With dead ends: 211 [2018-02-04 03:28:10,560 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 03:28:10,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:28:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 03:28:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 185. [2018-02-04 03:28:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 03:28:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 217 transitions. [2018-02-04 03:28:10,569 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 217 transitions. Word has length 33 [2018-02-04 03:28:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:10,570 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 217 transitions. [2018-02-04 03:28:10,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:28:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 217 transitions. [2018-02-04 03:28:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 03:28:10,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:10,570 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:10,571 INFO L371 AbstractCegarLoop]: === Iteration 20 === [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-02-04 03:28:10,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1911217638, now seen corresponding path program 1 times [2018-02-04 03:28:10,571 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:10,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:10,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:10,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:28:10,651 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:10,652 INFO L182 omatonBuilderFactory]: Interpolants [6496#(and (= re_insert_~x.offset 0) (= (select |#length| re_insert_~x.base) 8)), 6490#true, 6491#false, 6492#(and (= 8 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|)), 6493#(and (= main_~x~0.offset |main_~#list~0.offset|) (= 8 (select |#length| |main_~#list~0.base|)) (= main_~x~0.base |main_~#list~0.base|) (= 0 |main_~#list~0.offset|)), 6494#(and (= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 6495#(and (= 0 |re_insert_#in~x.offset|) (= 8 (select |#length| |re_insert_#in~x.base|)))] [2018-02-04 03:28:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:10,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:28:10,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:28:10,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:28:10,653 INFO L87 Difference]: Start difference. First operand 185 states and 217 transitions. Second operand 7 states. [2018-02-04 03:28:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:10,835 INFO L93 Difference]: Finished difference Result 212 states and 245 transitions. [2018-02-04 03:28:10,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:28:10,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-04 03:28:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:10,836 INFO L225 Difference]: With dead ends: 212 [2018-02-04 03:28:10,836 INFO L226 Difference]: Without dead ends: 212 [2018-02-04 03:28:10,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:28:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-04 03:28:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 198. [2018-02-04 03:28:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 03:28:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 239 transitions. [2018-02-04 03:28:10,839 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 239 transitions. Word has length 36 [2018-02-04 03:28:10,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:10,839 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 239 transitions. [2018-02-04 03:28:10,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:28:10,839 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 239 transitions. [2018-02-04 03:28:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 03:28:10,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:10,840 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:10,840 INFO L371 AbstractCegarLoop]: === Iteration 21 === [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-02-04 03:28:10,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1911217639, now seen corresponding path program 1 times [2018-02-04 03:28:10,841 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:10,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:10,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:10,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:28:10,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:10,877 INFO L182 omatonBuilderFactory]: Interpolants [6912#(and (= main_~x~0.base |main_~#list~0.base|) (= 1 (select |#valid| |main_~#list~0.base|))), 6913#(= 1 (select |#valid| main_~x~0.base)), 6914#(= 1 (select |#valid| |re_insert_#in~x.base|)), 6915#(= 1 (select |#valid| re_insert_~x.base)), 6909#true, 6910#false, 6911#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-04 03:28:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:10,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:28:10,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:28:10,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:28:10,878 INFO L87 Difference]: Start difference. First operand 198 states and 239 transitions. Second operand 7 states. [2018-02-04 03:28:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:11,000 INFO L93 Difference]: Finished difference Result 202 states and 236 transitions. [2018-02-04 03:28:11,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:28:11,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-04 03:28:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:11,002 INFO L225 Difference]: With dead ends: 202 [2018-02-04 03:28:11,002 INFO L226 Difference]: Without dead ends: 202 [2018-02-04 03:28:11,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:28:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-04 03:28:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2018-02-04 03:28:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 03:28:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 232 transitions. [2018-02-04 03:28:11,007 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 232 transitions. Word has length 36 [2018-02-04 03:28:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:11,007 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 232 transitions. [2018-02-04 03:28:11,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:28:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 232 transitions. [2018-02-04 03:28:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:28:11,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:11,008 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:11,008 INFO L371 AbstractCegarLoop]: === Iteration 22 === [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-02-04 03:28:11,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1964561354, now seen corresponding path program 1 times [2018-02-04 03:28:11,009 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:11,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:11,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:11,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:28:11,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:11,334 INFO L182 omatonBuilderFactory]: Interpolants [7315#true, 7316#false, 7317#(= |main_~#list~0.offset| 0), 7318#(and (= 0 (select (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4) 0) |main_~#list~0.offset|)) (= 0 (select (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4) 0) |main_~#list~0.offset|)) (= |main_~#list~0.offset| 0) (= 1 (select |#valid| |main_~#list~0.base|))), 7319#(and (= main_~tail~0.base |main_~#list~0.base|) (<= |main_~#list~0.offset| main_~tail~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= main_~tail~0.base main_~x~0.base) (= |main_~#list~0.offset| main_~x~0.offset) (= (select |#valid| |main_~#list~0.base|) 1)), 7320#(and (not (= |main_~#list~0.base| |main_#t~malloc21.base|)) (= main_~tail~0.base |main_~#list~0.base|) (<= |main_~#list~0.offset| main_~tail~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= main_~tail~0.base main_~x~0.base) (= |main_~#list~0.offset| main_~x~0.offset)), 7321#(and (= main_~tail~0.base |main_~#list~0.base|) (<= |main_~#list~0.offset| main_~tail~0.offset) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset main_~tail~0.base)) |main_~#list~0.base|) |main_~#list~0.offset|)) (= main_~tail~0.base main_~x~0.base) (= |main_~#list~0.offset| main_~x~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset main_~tail~0.offset)) |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| main_~n~0.base))), 7322#(and (<= |main_~#list~0.offset| main_~tail~0.offset) (= main_~tail~0.base main_~x~0.base) (= |main_~#list~0.offset| main_~x~0.offset) (not (= |main_~#list~0.base| main_~n~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base) |main_~#list~0.offset|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.offset) |main_~#list~0.offset|))), 7323#(and (= |main_~#list~0.offset| main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) |main_~#list~0.offset|))), 7324#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7325#(and (= 0 (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) |remove_#in~x.offset|))), 7326#(and (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) remove_~x.offset)) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) remove_~x.offset))), 7327#(and (= |remove_#t~mem5.base| 0) (= 0 |remove_#t~mem5.offset|))] [2018-02-04 03:28:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:11,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:28:11,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:28:11,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:28:11,335 INFO L87 Difference]: Start difference. First operand 195 states and 232 transitions. Second operand 13 states. [2018-02-04 03:28:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:11,713 INFO L93 Difference]: Finished difference Result 225 states and 276 transitions. [2018-02-04 03:28:11,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:11,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-02-04 03:28:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:11,714 INFO L225 Difference]: With dead ends: 225 [2018-02-04 03:28:11,714 INFO L226 Difference]: Without dead ends: 225 [2018-02-04 03:28:11,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:28:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-04 03:28:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 197. [2018-02-04 03:28:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-04 03:28:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 234 transitions. [2018-02-04 03:28:11,718 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 234 transitions. Word has length 35 [2018-02-04 03:28:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:11,718 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 234 transitions. [2018-02-04 03:28:11,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:28:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 234 transitions. [2018-02-04 03:28:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 03:28:11,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:11,718 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:11,718 INFO L371 AbstractCegarLoop]: === Iteration 23 === [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-02-04 03:28:11,719 INFO L82 PathProgramCache]: Analyzing trace with hash -137022243, now seen corresponding path program 1 times [2018-02-04 03:28:11,719 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:11,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:28:11,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:11,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:28:11,799 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:11,799 INFO L182 omatonBuilderFactory]: Interpolants [7760#true, 7761#false, 7762#(and (= 0 |main_#t~malloc21.offset|) (= 8 (select |#length| |main_#t~malloc21.base|))), 7763#(and (= 0 main_~n~0.offset) (= 8 (select |#length| main_~n~0.base))), 7764#(and (= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 7765#(and (= 0 |remove_#in~x.offset|) (= 8 (select |#length| |remove_#in~x.base|))), 7766#(and (= remove_~x.offset 0) (= (select |#length| remove_~x.base) 8))] [2018-02-04 03:28:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:28:11,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:28:11,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:28:11,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:28:11,800 INFO L87 Difference]: Start difference. First operand 197 states and 234 transitions. Second operand 7 states. [2018-02-04 03:28:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:12,108 INFO L93 Difference]: Finished difference Result 216 states and 258 transitions. [2018-02-04 03:28:12,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:28:12,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-04 03:28:12,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:12,110 INFO L225 Difference]: With dead ends: 216 [2018-02-04 03:28:12,110 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 03:28:12,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:28:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 03:28:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 191. [2018-02-04 03:28:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 03:28:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 228 transitions. [2018-02-04 03:28:12,114 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 228 transitions. Word has length 38 [2018-02-04 03:28:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:12,115 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 228 transitions. [2018-02-04 03:28:12,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:28:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 228 transitions. [2018-02-04 03:28:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:28:12,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:12,115 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:12,115 INFO L371 AbstractCegarLoop]: === Iteration 24 === [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-02-04 03:28:12,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1296859951, now seen corresponding path program 1 times [2018-02-04 03:28:12,116 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:12,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:12,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:12,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:28:12,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:12,237 INFO L182 omatonBuilderFactory]: Interpolants [8182#true, 8183#false, 8184#(= |main_~#list~0.offset| 0), 8185#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= |main_~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))), 8186#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))), 8187#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8188#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4))) (= 0 main_~x~0.offset)), 8189#(and (= 0 |re_insert_#in~x.offset|) (= 0 (select (select |#memory_$Pointer$.base| |re_insert_#in~x.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| |re_insert_#in~x.base|) (+ 0 4)))), 8190#(and (= re_insert_~x.offset 0) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) (+ re_insert_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) (+ re_insert_~x.offset 4)))), 8191#(and (= |re_insert_#t~mem9.base| (select (select |#memory_$Pointer$.base| re_insert_~x.base) (+ re_insert_~x.offset 4))) (= re_insert_~x.offset 0) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) (+ re_insert_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) (+ re_insert_~x.offset 4))) (= |re_insert_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| re_insert_~x.base) (+ re_insert_~x.offset 4))))] [2018-02-04 03:28:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:12,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:28:12,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:28:12,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:28:12,237 INFO L87 Difference]: Start difference. First operand 191 states and 228 transitions. Second operand 10 states. [2018-02-04 03:28:12,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:12,472 INFO L93 Difference]: Finished difference Result 244 states and 292 transitions. [2018-02-04 03:28:12,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:28:12,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-02-04 03:28:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:12,473 INFO L225 Difference]: With dead ends: 244 [2018-02-04 03:28:12,473 INFO L226 Difference]: Without dead ends: 244 [2018-02-04 03:28:12,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:28:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-04 03:28:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 209. [2018-02-04 03:28:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-04 03:28:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 252 transitions. [2018-02-04 03:28:12,477 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 252 transitions. Word has length 39 [2018-02-04 03:28:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:12,477 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 252 transitions. [2018-02-04 03:28:12,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:28:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 252 transitions. [2018-02-04 03:28:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:28:12,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:12,478 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:12,478 INFO L371 AbstractCegarLoop]: === Iteration 25 === [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-02-04 03:28:12,478 INFO L82 PathProgramCache]: Analyzing trace with hash 190013479, now seen corresponding path program 1 times [2018-02-04 03:28:12,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:12,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:28:12,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:12,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:28:12,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:12,604 INFO L182 omatonBuilderFactory]: Interpolants [8656#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= |main_~#list~0.offset| 0)), 8657#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= (select |#valid| main_~n~0.base) 1) (= |main_~#list~0.offset| 0)), 8658#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (= |main_~#list~0.offset| 0)), 8659#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) (+ 0 4)))) (= 0 |is_list_containing_x_#in~l.offset|)), 8660#(and (= is_list_containing_x_~l.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))))), 8661#(= 1 (select |#valid| |is_list_containing_x_#t~mem16.base|)), 8662#(= 1 (select |#valid| |is_list_containing_x_#in~l.base|)), 8663#(= 1 (select |#valid| is_list_containing_x_~l.base)), 8653#true, 8654#false, 8655#(= |main_~#list~0.offset| 0)] [2018-02-04 03:28:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:28:12,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:28:12,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:28:12,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:28:12,604 INFO L87 Difference]: Start difference. First operand 209 states and 252 transitions. Second operand 11 states. [2018-02-04 03:28:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:12,901 INFO L93 Difference]: Finished difference Result 265 states and 330 transitions. [2018-02-04 03:28:12,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:28:12,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-02-04 03:28:12,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:12,902 INFO L225 Difference]: With dead ends: 265 [2018-02-04 03:28:12,902 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 03:28:12,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:28:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 03:28:12,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 229. [2018-02-04 03:28:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-04 03:28:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 274 transitions. [2018-02-04 03:28:12,906 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 274 transitions. Word has length 39 [2018-02-04 03:28:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:12,906 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 274 transitions. [2018-02-04 03:28:12,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:28:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 274 transitions. [2018-02-04 03:28:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:28:12,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:12,906 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:12,906 INFO L371 AbstractCegarLoop]: === Iteration 26 === [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-02-04 03:28:12,906 INFO L82 PathProgramCache]: Analyzing trace with hash 190013480, now seen corresponding path program 1 times [2018-02-04 03:28:12,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:12,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:13,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:13,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:28:13,173 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:13,174 INFO L182 omatonBuilderFactory]: Interpolants [9184#(and (= 8 (select |#length| is_list_containing_x_~l.base)) (= is_list_containing_x_~l.offset 0)), 9170#true, 9171#false, 9172#(= |main_~#list~0.offset| 0), 9173#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= |main_~#list~0.offset| 0)), 9174#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= 0 |main_#t~malloc21.offset|) (= |main_~#list~0.offset| 0)), 9175#(and (= 0 main_~n~0.offset) (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= |main_~#list~0.offset| 0)), 9176#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 9177#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= 8 (select |#length| |main_#t~malloc21.base|)) (= |main_~#list~0.offset| 0) (= |main_#t~malloc21.offset| main_~x~0.offset) (= 0 main_~x~0.offset)), 9178#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= main_~n~0.offset main_~x~0.offset) (= 8 (select |#length| main_~n~0.base)) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 9179#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)) main_~x~0.offset) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 9180#(and (= 0 |is_list_containing_x_#in~l.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) (+ 0 4)))) (= 0 |is_list_containing_x_#in~x.offset|) (= (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) (+ 0 4)) |is_list_containing_x_#in~x.offset|)), 9181#(and (= 0 is_list_containing_x_~x.offset) (= (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)) is_list_containing_x_~x.offset) (= is_list_containing_x_~l.offset 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))))), 9182#(and (= 0 is_list_containing_x_~x.offset) (= 8 (select |#length| |is_list_containing_x_#t~mem16.base|)) (= |is_list_containing_x_#t~mem16.offset| is_list_containing_x_~x.offset)), 9183#(and (= 8 (select |#length| |is_list_containing_x_#in~l.base|)) (= |is_list_containing_x_#in~l.offset| |is_list_containing_x_#in~x.offset|) (= 0 |is_list_containing_x_#in~x.offset|))] [2018-02-04 03:28:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:13,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:28:13,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:28:13,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:13,175 INFO L87 Difference]: Start difference. First operand 229 states and 274 transitions. Second operand 15 states. [2018-02-04 03:28:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:13,528 INFO L93 Difference]: Finished difference Result 246 states and 298 transitions. [2018-02-04 03:28:13,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:28:13,528 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-02-04 03:28:13,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:13,529 INFO L225 Difference]: With dead ends: 246 [2018-02-04 03:28:13,530 INFO L226 Difference]: Without dead ends: 246 [2018-02-04 03:28:13,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:28:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-04 03:28:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 229. [2018-02-04 03:28:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-04 03:28:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 272 transitions. [2018-02-04 03:28:13,535 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 272 transitions. Word has length 39 [2018-02-04 03:28:13,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:13,536 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 272 transitions. [2018-02-04 03:28:13,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:28:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 272 transitions. [2018-02-04 03:28:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:28:13,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:13,537 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:13,537 INFO L371 AbstractCegarLoop]: === Iteration 27 === [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-02-04 03:28:13,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1458117372, now seen corresponding path program 1 times [2018-02-04 03:28:13,538 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:13,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:13,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:13,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:13,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:28:13,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:13,851 INFO L182 omatonBuilderFactory]: Interpolants [9670#true, 9671#false, 9672#(= |main_~#list~0.offset| 0), 9673#(and (= 0 (select (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4) 0) |main_~#list~0.offset|)) (= 0 (select (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4) 0) |main_~#list~0.offset|)) (= |main_~#list~0.offset| 0) (= 1 (select |#valid| |main_~#list~0.base|))), 9674#(and (= main_~tail~0.base |main_~#list~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= main_~tail~0.base main_~x~0.base) (= |main_~#list~0.offset| main_~x~0.offset) (= (select |#valid| |main_~#list~0.base|) 1) (not (= |main_~#list~0.offset| (+ main_~tail~0.offset 4)))), 9675#(and (not (= |main_~#list~0.base| |main_#t~malloc21.base|)) (= main_~tail~0.base |main_~#list~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= main_~tail~0.base main_~x~0.base) (= |main_~#list~0.offset| main_~x~0.offset) (not (= |main_~#list~0.offset| (+ main_~tail~0.offset 4)))), 9676#(and (= main_~tail~0.base |main_~#list~0.base|) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset main_~tail~0.base)) |main_~#list~0.base|) |main_~#list~0.offset|)) (= main_~tail~0.base main_~x~0.base) (= |main_~#list~0.offset| main_~x~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset main_~tail~0.offset)) |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| main_~n~0.base)) (not (= |main_~#list~0.offset| (+ main_~tail~0.offset 4)))), 9677#(and (= main_~tail~0.base main_~x~0.base) (= |main_~#list~0.offset| main_~x~0.offset) (not (= |main_~#list~0.base| main_~n~0.base)) (= 0 (select (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base) |main_~#list~0.offset|)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.offset) |main_~#list~0.offset|)) (not (= |main_~#list~0.offset| (+ main_~tail~0.offset 4)))), 9678#(and (= |main_~#list~0.offset| main_~x~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) |main_~#list~0.offset|))), 9679#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 9680#(and (= 0 (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) |remove_#in~x.offset|))), 9681#(and (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) remove_~x.offset)) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) remove_~x.offset))), 9682#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) remove_~x.offset)) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) remove_~x.offset))) (= remove_~x.base |remove_#t~mem2.base|)) (or (not (= remove_~x.base |remove_#t~mem2.base|)) (and (or (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) remove_~x.offset)) (= remove_~x.offset |remove_#t~mem2.offset|)) (or (= 0 |remove_#t~mem4.offset|) (not (= remove_~x.offset |remove_#t~mem2.offset|))) (or (= 0 |remove_#t~mem4.base|) (not (= remove_~x.offset |remove_#t~mem2.offset|))) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) remove_~x.offset))))), 9683#(and (= |remove_#t~mem5.base| 0) (= 0 |remove_#t~mem5.offset|))] [2018-02-04 03:28:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:13,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:28:13,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:28:13,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:28:13,852 INFO L87 Difference]: Start difference. First operand 229 states and 272 transitions. Second operand 14 states. [2018-02-04 03:28:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:14,466 INFO L93 Difference]: Finished difference Result 253 states and 309 transitions. [2018-02-04 03:28:14,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:28:14,466 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-02-04 03:28:14,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:14,467 INFO L225 Difference]: With dead ends: 253 [2018-02-04 03:28:14,467 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 03:28:14,467 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:28:14,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 03:28:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 223. [2018-02-04 03:28:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 03:28:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 263 transitions. [2018-02-04 03:28:14,470 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 263 transitions. Word has length 39 [2018-02-04 03:28:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:14,470 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 263 transitions. [2018-02-04 03:28:14,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:28:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 263 transitions. [2018-02-04 03:28:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:28:14,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:14,471 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:14,471 INFO L371 AbstractCegarLoop]: === Iteration 28 === [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-02-04 03:28:14,471 INFO L82 PathProgramCache]: Analyzing trace with hash 750521981, now seen corresponding path program 1 times [2018-02-04 03:28:14,472 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:14,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:14,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:14,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:28:14,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:14,563 INFO L182 omatonBuilderFactory]: Interpolants [10176#true, 10177#false, 10178#(and (= 0 (select (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4) 0) |main_~#list~0.offset|)) (= 0 (select (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4) 0) |main_~#list~0.offset|))), 10179#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|)), 10180#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10181#(and (= remove_~x.base |remove_#in~x.base|) (= remove_~x.offset |remove_#in~x.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10182#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 10183#(and (= 0 (select (select |#memory_$Pointer$.offset| |re_insert_#in~x.base|) |re_insert_#in~x.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |re_insert_#in~x.base|) |re_insert_#in~x.offset|))), 10184#(and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset))), 10185#(and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (= |re_insert_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset)) (= |re_insert_#t~mem12.base| (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset)))] [2018-02-04 03:28:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:14,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:28:14,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:28:14,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:28:14,564 INFO L87 Difference]: Start difference. First operand 223 states and 263 transitions. Second operand 10 states. [2018-02-04 03:28:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:14,770 INFO L93 Difference]: Finished difference Result 256 states and 299 transitions. [2018-02-04 03:28:14,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:28:14,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-02-04 03:28:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:14,771 INFO L225 Difference]: With dead ends: 256 [2018-02-04 03:28:14,771 INFO L226 Difference]: Without dead ends: 256 [2018-02-04 03:28:14,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:28:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-04 03:28:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2018-02-04 03:28:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 03:28:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 256 transitions. [2018-02-04 03:28:14,776 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 256 transitions. Word has length 41 [2018-02-04 03:28:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:14,776 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 256 transitions. [2018-02-04 03:28:14,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:28:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 256 transitions. [2018-02-04 03:28:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:28:14,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:14,777 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:14,777 INFO L371 AbstractCegarLoop]: === Iteration 29 === [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-02-04 03:28:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash -296541728, now seen corresponding path program 1 times [2018-02-04 03:28:14,778 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:14,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:15,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:15,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:28:15,072 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,073 INFO L182 omatonBuilderFactory]: Interpolants [10667#true, 10668#false, 10669#(= |main_~#list~0.offset| 0), 10670#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 10671#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| |main_#t~malloc21.offset|) (= |main_~#list~0.offset| 0)), 10672#(and (= 0 main_~n~0.offset) (or (= main_~n~0.base |main_~#list~0.base|) (not (= main_~n~0.base main_~tail~0.base))) (= |main_~#list~0.offset| 0)), 10673#(and (= 0 main_~n~0.offset) (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))) (or (and (= 0 (select (select (store |#memory_$Pointer$.base| main_~tail~0.base (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~tail~0.base (store (select |#memory_$Pointer$.offset| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.offset)) main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_~#list~0.offset| 0)) (= main_~n~0.base main_~tail~0.base))), 10674#(and (= 0 main_~n~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_~#list~0.offset| 0)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset)))), 10675#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= |main_~#list~0.offset| 0)) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))) (= 0 main_~x~0.offset)), 10676#(and (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)), 10677#(or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))), 10678#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4))) (= 0 main_~x~0.offset)), 10679#(and (= 0 |remove_#in~x.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) (+ 0 4)))), 10680#(and (= remove_~x.offset 0) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)))), 10681#(and (= |remove_#t~mem1.offset| 0) (= |remove_#t~mem1.base| (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= remove_~x.offset 0) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))))] [2018-02-04 03:28:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:15,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:28:15,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:28:15,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:15,074 INFO L87 Difference]: Start difference. First operand 219 states and 256 transitions. Second operand 15 states. [2018-02-04 03:28:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:15,532 INFO L93 Difference]: Finished difference Result 248 states and 304 transitions. [2018-02-04 03:28:15,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:28:15,532 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-02-04 03:28:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:15,533 INFO L225 Difference]: With dead ends: 248 [2018-02-04 03:28:15,533 INFO L226 Difference]: Without dead ends: 248 [2018-02-04 03:28:15,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:28:15,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-04 03:28:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 213. [2018-02-04 03:28:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 03:28:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2018-02-04 03:28:15,538 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 42 [2018-02-04 03:28:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:15,538 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2018-02-04 03:28:15,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:28:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2018-02-04 03:28:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:28:15,539 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:15,539 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:15,539 INFO L371 AbstractCegarLoop]: === Iteration 30 === [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-02-04 03:28:15,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1152741502, now seen corresponding path program 1 times [2018-02-04 03:28:15,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:15,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:15,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:15,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:28:15,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:15,671 INFO L182 omatonBuilderFactory]: Interpolants [11168#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| |main_#t~malloc21.offset|)), 11169#(or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))), 11170#(and (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))) (= main_~tail~0.base (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset))), 11171#(and (or (= main_~tail~0.base (select (select (store |#memory_$Pointer$.base| main_~tail~0.base (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~tail~0.base)) (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset)))), 11172#(or (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 11173#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))), 11174#(and (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)), 11175#(or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))), 11176#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 11177#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|))), 11178#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| remove_~x.base) remove_~x.offset))), 11179#(= 1 (select |#valid| |remove_#t~mem6.base|)), 11164#true, 11165#false, 11166#(= |main_~#list~0.offset| 0), 11167#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0))] [2018-02-04 03:28:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:15,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:28:15,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:28:15,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:28:15,672 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand 16 states. [2018-02-04 03:28:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:16,173 INFO L93 Difference]: Finished difference Result 263 states and 322 transitions. [2018-02-04 03:28:16,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:28:16,174 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-02-04 03:28:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:16,175 INFO L225 Difference]: With dead ends: 263 [2018-02-04 03:28:16,175 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 03:28:16,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:28:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 03:28:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 225. [2018-02-04 03:28:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-04 03:28:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 264 transitions. [2018-02-04 03:28:16,179 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 264 transitions. Word has length 44 [2018-02-04 03:28:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:16,179 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 264 transitions. [2018-02-04 03:28:16,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:28:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 264 transitions. [2018-02-04 03:28:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:28:16,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:16,180 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:16,180 INFO L371 AbstractCegarLoop]: === Iteration 31 === [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-02-04 03:28:16,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1152741501, now seen corresponding path program 1 times [2018-02-04 03:28:16,181 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:16,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:16,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:16,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:28:16,458 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:16,458 INFO L182 omatonBuilderFactory]: Interpolants [11693#true, 11694#false, 11695#(and (= 8 (select |#length| |main_~#list~0.base|)) (= |main_~#list~0.offset| 0)), 11696#(and (= main_~tail~0.base |main_~#list~0.base|) (= 8 (select |#length| |main_~#list~0.base|)) (= 0 main_~tail~0.offset) (= |main_~#list~0.offset| 0)), 11697#(and (= main_~tail~0.base |main_~#list~0.base|) (= 0 main_~tail~0.offset) (= |main_~#list~0.offset| |main_#t~malloc21.offset|) (or (= |main_~#list~0.base| |main_#t~malloc21.base|) (= 8 (select |#length| main_~tail~0.base)))), 11698#(and (= |main_~#list~0.offset| main_~n~0.offset) (or (and (or (= main_~n~0.base |main_~#list~0.base|) (= 8 (select |#length| main_~tail~0.base))) (= 0 main_~tail~0.offset)) (= main_~n~0.base main_~tail~0.base)) (or (= main_~n~0.base |main_~#list~0.base|) (not (= main_~n~0.base main_~tail~0.base)))), 11699#(and (or (= main_~n~0.base main_~tail~0.base) (and (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset)) (or (= main_~n~0.base |main_~#list~0.base|) (and (= 8 (select |#length| main_~tail~0.base)) (= main_~tail~0.base (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset)))))) (= |main_~#list~0.offset| main_~n~0.offset) (or (= main_~n~0.base |main_~#list~0.base|) (not (= main_~n~0.base main_~tail~0.base)))), 11700#(and (or (= main_~n~0.base |main_~#list~0.base|) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)))) (= |main_~#list~0.offset| main_~n~0.offset)), 11701#(and (= |main_~#list~0.offset| main_~x~0.offset) (or (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base |main_~#list~0.base|))), 11702#(and (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)), 11703#(or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))), 11704#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 11705#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) |remove_#in~x.offset|))), 11706#(and (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) remove_~x.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| remove_~x.base) remove_~x.offset)))), 11707#(and (= |remove_#t~mem6.offset| 0) (= (select |#length| |remove_#t~mem6.base|) 8))] [2018-02-04 03:28:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:16,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:28:16,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:28:16,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:28:16,459 INFO L87 Difference]: Start difference. First operand 225 states and 264 transitions. Second operand 15 states. [2018-02-04 03:28:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:17,177 INFO L93 Difference]: Finished difference Result 261 states and 321 transitions. [2018-02-04 03:28:17,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:28:17,177 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-02-04 03:28:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:17,179 INFO L225 Difference]: With dead ends: 261 [2018-02-04 03:28:17,179 INFO L226 Difference]: Without dead ends: 261 [2018-02-04 03:28:17,179 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:28:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-04 03:28:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 226. [2018-02-04 03:28:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 03:28:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 264 transitions. [2018-02-04 03:28:17,184 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 264 transitions. Word has length 44 [2018-02-04 03:28:17,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:17,185 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 264 transitions. [2018-02-04 03:28:17,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:28:17,185 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 264 transitions. [2018-02-04 03:28:17,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 03:28:17,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:17,186 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:17,186 INFO L371 AbstractCegarLoop]: === Iteration 32 === [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-02-04 03:28:17,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1242028496, now seen corresponding path program 2 times [2018-02-04 03:28:17,187 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:17,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:17,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:17,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:28:17,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:17,658 INFO L182 omatonBuilderFactory]: Interpolants [12224#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (not (= main_~tail~0.base |main_#t~malloc21.base|)) (= |main_~#list~0.offset| 0) (= |main_#t~malloc21.offset| main_~x~0.offset) (= 0 main_~x~0.offset)), 12225#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= main_~n~0.offset 0) (not (= main_~tail~0.base main_~n~0.base)) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 12226#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= main_~n~0.offset 0) (not (= main_~tail~0.base main_~n~0.base)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~tail~0.base (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~tail~0.base (store (select |#memory_$Pointer$.offset| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.offset)) main_~n~0.base) (+ main_~n~0.offset 4))) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 12227#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (+ |main_~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)) main_~x~0.offset) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 12228#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) (+ 0 4))) (+ 0 4))) (= 0 |is_list_containing_x_#in~l.offset|) (= 0 |is_list_containing_x_#in~x.offset|) (= (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) (+ 0 4)) |is_list_containing_x_#in~x.offset|) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) (+ 0 4))) (+ 0 4)))), 12229#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (+ 0 4))) (= 0 is_list_containing_x_~x.offset) (= (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)) is_list_containing_x_~x.offset) (= is_list_containing_x_~l.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (+ 0 4)))), 12230#(and (= 0 (select (select |#memory_$Pointer$.base| |is_list_containing_x_#t~mem16.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#t~mem16.base|) (+ 0 4))) (= 0 is_list_containing_x_~x.offset) (= |is_list_containing_x_#t~mem16.offset| is_list_containing_x_~x.offset)), 12231#(and (= 0 (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) (+ 0 4))) (= |is_list_containing_x_#in~l.offset| |is_list_containing_x_#in~x.offset|) (= 0 |is_list_containing_x_#in~x.offset|) (= 0 (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) (+ 0 4)))), 12232#(and (= 0 (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (= is_list_containing_x_~x.offset is_list_containing_x_~l.offset) (= 0 (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (= is_list_containing_x_~l.offset 0)), 12233#(and (= 0 (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (= is_list_containing_x_~l.offset 0)), 12234#(and (= 0 (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (= |is_list_containing_x_#t~mem15.base| (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (= is_list_containing_x_~l.offset 0) (= |is_list_containing_x_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)))), 12216#true, 12217#false, 12218#(= |main_~#list~0.offset| 0), 12219#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= |main_~#list~0.offset| 0)), 12220#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= |main_#t~malloc21.offset| 0) (= |main_~#list~0.offset| 0)), 12221#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= main_~n~0.offset 0) (= |main_~#list~0.offset| 0)), 12222#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= main_~n~0.offset 0) (= 1 (select |#valid| main_~tail~0.base)) (= |main_~#list~0.offset| 0)), 12223#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= 1 (select |#valid| main_~tail~0.base)) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset))] [2018-02-04 03:28:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:17,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:28:17,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:28:17,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:28:17,658 INFO L87 Difference]: Start difference. First operand 226 states and 264 transitions. Second operand 19 states. [2018-02-04 03:28:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:18,386 INFO L93 Difference]: Finished difference Result 293 states and 359 transitions. [2018-02-04 03:28:18,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:28:18,387 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-02-04 03:28:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:18,388 INFO L225 Difference]: With dead ends: 293 [2018-02-04 03:28:18,388 INFO L226 Difference]: Without dead ends: 293 [2018-02-04 03:28:18,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2018-02-04 03:28:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-04 03:28:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 223. [2018-02-04 03:28:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-04 03:28:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 259 transitions. [2018-02-04 03:28:18,394 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 259 transitions. Word has length 45 [2018-02-04 03:28:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:18,395 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 259 transitions. [2018-02-04 03:28:18,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:28:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 259 transitions. [2018-02-04 03:28:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:28:18,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:18,396 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:18,396 INFO L371 AbstractCegarLoop]: === Iteration 33 === [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-02-04 03:28:18,396 INFO L82 PathProgramCache]: Analyzing trace with hash -180741272, now seen corresponding path program 1 times [2018-02-04 03:28:18,396 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:18,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:18,579 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:18,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:28:18,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:18,579 INFO L182 omatonBuilderFactory]: Interpolants [12784#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 12785#(and (or (not (= remove_~x.offset 0)) (and (= remove_~x.base |remove_#in~x.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 12786#(and (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0)) (or (not (= remove_~x.offset 0)) (and (= remove_~x.base |remove_#in~x.base|) (= (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)) |remove_#t~mem1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))), 12787#(and (or (not (= remove_~x.offset 0)) (and (= remove_~x.base |remove_#in~x.base|) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 12788#(or (= 0 (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ (- 0) 4))) (not (= |remove_#in~x.offset| 0))), 12777#true, 12778#false, 12779#(= |main_~#list~0.offset| 0), 12780#(and (= |main_~#list~0.offset| main_~tail~0.offset) (= main_~tail~0.base main_~x~0.base) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 12781#(and (= |main_~#list~0.offset| main_~tail~0.offset) (not (= 0 |main_#t~malloc21.base|)) (= main_~tail~0.base main_~x~0.base) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 12782#(and (not (= 0 main_~n~0.base)) (= |main_~#list~0.offset| main_~tail~0.offset) (= main_~tail~0.base main_~x~0.base) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 12783#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4)))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0))] [2018-02-04 03:28:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:18,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:28:18,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:28:18,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:28:18,580 INFO L87 Difference]: Start difference. First operand 223 states and 259 transitions. Second operand 12 states. [2018-02-04 03:28:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:18,846 INFO L93 Difference]: Finished difference Result 254 states and 294 transitions. [2018-02-04 03:28:18,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:28:18,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-02-04 03:28:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:18,847 INFO L225 Difference]: With dead ends: 254 [2018-02-04 03:28:18,847 INFO L226 Difference]: Without dead ends: 250 [2018-02-04 03:28:18,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:28:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-04 03:28:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 220. [2018-02-04 03:28:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 03:28:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 253 transitions. [2018-02-04 03:28:18,850 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 253 transitions. Word has length 48 [2018-02-04 03:28:18,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:18,850 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 253 transitions. [2018-02-04 03:28:18,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:28:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 253 transitions. [2018-02-04 03:28:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 03:28:18,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:18,851 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:18,851 INFO L371 AbstractCegarLoop]: === Iteration 34 === [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-02-04 03:28:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1440013922, now seen corresponding path program 1 times [2018-02-04 03:28:18,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:18,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:19,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:19,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:28:19,495 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:19,496 INFO L182 omatonBuilderFactory]: Interpolants [13280#(and (= main_~tail~0.base |main_~#list~0.base|) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (= (select |#valid| |main_~#list~0.base|) 1) (= |main_~#list~0.offset| 0)), 13281#(and (not (= |main_~#list~0.base| |main_#t~malloc21.base|)) (= main_~tail~0.base |main_~#list~0.base|) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (= |main_~#list~0.offset| 0)), 13282#(and (= main_~tail~0.base |main_~#list~0.base|) (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset main_~tail~0.offset)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset main_~tail~0.base)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (not (= |main_~#list~0.base| main_~n~0.base)) (= |main_~#list~0.offset| 0)), 13283#(and (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= main_~tail~0.base main_~x~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) 0)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (or (not (= |main_~#list~0.offset| main_~tail~0.offset)) (and (= main_~tail~0.base |main_~#list~0.base|) (= (select |#valid| main_~n~0.base) 1))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (not (= |main_~#list~0.base| main_~n~0.base)) (= |main_~#list~0.offset| 0)), 13284#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 13285#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13286#(and (or (not (= remove_~x.offset 0)) (and (= remove_~x.base |remove_#in~x.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 13287#(and (or (not (= remove_~x.offset 0)) (and (= |remove_#t~mem1.base| (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= remove_~x.base |remove_#in~x.base|) (= |remove_#t~mem1.offset| (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 13288#(and (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0)) (or (and (= remove_~x.base |remove_#in~x.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (and (not (= (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)) 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)))))) (not (= remove_~x.offset 0)))), 13289#(and (or (not (= remove_~x.offset 0)) (and (= remove_~x.base |remove_#in~x.base|) (or (not (= remove_~x.base |remove_#t~mem2.base|)) (= (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)) |remove_#in~x.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (and (not (= (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)) 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))))))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 13290#(and (or (and (or (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ remove_~x.offset 4)) (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ remove_~x.offset 4)) |remove_#in~x.base|)) (= remove_~x.base |remove_#in~x.base|) (or (not (= 0 (select (select |old(#memory_$Pointer$.base)| remove_~x.base) (+ remove_~x.offset 4)))) (not (= (select (select |old(#memory_$Pointer$.offset)| |remove_#in~x.base|) (+ remove_~x.offset 4)) 0)))) (not (= remove_~x.offset 0))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 13291#(or (and (or (not (= 0 (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ (- 0) 4)))) (not (= (select (select |old(#memory_$Pointer$.offset)| |remove_#in~x.base|) (+ (- 0) 4)) 0))) (or (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ (- 0) 4)) |remove_#in~x.base|) (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ (- 0) 4)) (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) (+ (- 0) 4))))) (not (= |remove_#in~x.offset| 0))), 13292#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4)))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 13293#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4)))) (= 0 main_~x~0.offset)), 13294#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|), 13295#(not (= |__VERIFIER_assert_#in~cond| 0)), 13296#(and (= 0 |re_insert_#in~x.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |re_insert_#in~x.base|) (+ 0 4))))), 13297#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| re_insert_~x.base) (+ re_insert_~x.offset 4)))) (= re_insert_~x.offset 0)), 13298#(= 1 (select |#valid| |re_insert_#t~mem10.base|)), 13275#true, 13276#false, 13277#(= |main_~#list~0.offset| 0), 13278#(and (= |main_~#list~0.offset| 0) (= 1 (select |#valid| |main_~#list~0.base|))), 13279#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= (select |#valid| |main_~#list~0.base|) 1) (= |main_~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))] [2018-02-04 03:28:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:19,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:28:19,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:28:19,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:28:19,497 INFO L87 Difference]: Start difference. First operand 220 states and 253 transitions. Second operand 24 states. [2018-02-04 03:28:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:20,840 INFO L93 Difference]: Finished difference Result 257 states and 292 transitions. [2018-02-04 03:28:20,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:28:20,841 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-02-04 03:28:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:20,841 INFO L225 Difference]: With dead ends: 257 [2018-02-04 03:28:20,841 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 03:28:20,842 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=214, Invalid=1592, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 03:28:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 03:28:20,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 220. [2018-02-04 03:28:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 03:28:20,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 252 transitions. [2018-02-04 03:28:20,844 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 252 transitions. Word has length 52 [2018-02-04 03:28:20,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:20,844 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 252 transitions. [2018-02-04 03:28:20,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:28:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 252 transitions. [2018-02-04 03:28:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 03:28:20,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:20,845 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:20,845 INFO L371 AbstractCegarLoop]: === Iteration 35 === [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-02-04 03:28:20,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1440013923, now seen corresponding path program 1 times [2018-02-04 03:28:20,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:20,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:21,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:21,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 03:28:21,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:21,520 INFO L182 omatonBuilderFactory]: Interpolants [13824#(and (or (not (= remove_~x.offset 0)) (and (= remove_~x.base |remove_#in~x.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 13825#(and (or (not (= remove_~x.offset 0)) (and (= |remove_#t~mem1.base| (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= remove_~x.base |remove_#in~x.base|) (= |remove_#t~mem1.offset| (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 13826#(and (or (and (= remove_~x.base |remove_#in~x.base|) (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))))) (not (= remove_~x.offset 0)) (and (= remove_~x.base |remove_#in~x.base|) (not (= (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)) 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 13827#(and (or (and (or (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4))) (= remove_~x.base |remove_#t~mem2.base|)) (= remove_~x.base |remove_#in~x.base|) (or (not (= remove_~x.base |remove_#t~mem2.base|)) (= (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)) |remove_#in~x.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))))) (not (= remove_~x.offset 0)) (and (= remove_~x.base |remove_#in~x.base|) (not (= (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)) 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 13828#(and (or (and (= remove_~x.base |remove_#in~x.base|) (not (= (select (select |old(#memory_$Pointer$.offset)| |remove_#in~x.base|) (+ remove_~x.offset 4)) 0))) (not (= remove_~x.offset 0)) (and (= remove_~x.base |remove_#in~x.base|) (not (= 0 (select (select |old(#memory_$Pointer$.base)| remove_~x.base) (+ remove_~x.offset 4)))) (or (and (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ remove_~x.offset 4)) (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)))) (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ remove_~x.offset 4)) |remove_#in~x.base|)))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 13829#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |remove_#in~x.base|) (+ (- 0) 4)) 0)) (not (= |remove_#in~x.offset| 0)) (and (not (= 0 (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ (- 0) 4)))) (or (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ (- 0) 4)) |remove_#in~x.base|) (and (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ (- 0) 4)) (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) (+ (- 0) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) (+ (- 0) 4))))))), 13830#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4)))) (= |main_~#list~0.offset| 0)), 13831#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ 0 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4)))) (= 0 main_~x~0.offset)), 13832#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|), 13833#(not (= |__VERIFIER_assert_#in~cond| 0)), 13834#(and (= 0 |re_insert_#in~x.offset|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |re_insert_#in~x.base|) (+ 0 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |re_insert_#in~x.base|) (+ 0 4)))), 13835#(and (= re_insert_~x.offset 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| re_insert_~x.base) (+ re_insert_~x.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) (+ re_insert_~x.offset 4)))), 13836#(and (= (select |#length| |re_insert_#t~mem10.base|) 8) (= |re_insert_#t~mem10.offset| 0)), 13814#true, 13815#false, 13816#(= |main_~#list~0.offset| 0), 13817#(and (= |main_~#list~0.offset| 0) (= 1 (select |#valid| |main_~#list~0.base|))), 13818#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= (select |#valid| |main_~#list~0.base|) 1) (= |main_~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))), 13819#(and (= main_~tail~0.base |main_~#list~0.base|) (or (= |main_~#list~0.offset| main_~tail~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (or (= |main_~#list~0.offset| main_~tail~0.offset) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= (select |#valid| |main_~#list~0.base|) 1) (= |main_~#list~0.offset| 0)), 13820#(and (not (= |main_~#list~0.base| |main_#t~malloc21.base|)) (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= main_~tail~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (or (= |main_~#list~0.offset| main_~tail~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (or (and (= main_~tail~0.base |main_~#list~0.base|) (= 0 |main_#t~malloc21.offset|)) (not (= |main_~#list~0.offset| main_~tail~0.offset))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (or (= 8 (select |#length| |main_#t~malloc21.base|)) (not (= |main_~#list~0.offset| main_~tail~0.offset))) (= |main_~#list~0.offset| 0)), 13821#(and (or (= |main_~#list~0.offset| main_~tail~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset main_~tail~0.offset)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (or (= 0 main_~n~0.offset) (not (= |main_~#list~0.offset| main_~tail~0.offset))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (not (= |main_~#list~0.base| main_~n~0.base)) (or (and (= main_~tail~0.base |main_~#list~0.base|) (= 8 (select |#length| main_~n~0.base))) (not (= |main_~#list~0.offset| main_~tail~0.offset))) (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= main_~tail~0.base main_~x~0.base) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset main_~tail~0.base)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (= |main_~#list~0.offset| 0)), 13822#(and (or (and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 13823#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 03:28:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:21,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:28:21,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:28:21,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:28:21,520 INFO L87 Difference]: Start difference. First operand 220 states and 252 transitions. Second operand 23 states. [2018-02-04 03:28:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:22,869 INFO L93 Difference]: Finished difference Result 265 states and 301 transitions. [2018-02-04 03:28:22,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 03:28:22,869 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 52 [2018-02-04 03:28:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:22,870 INFO L225 Difference]: With dead ends: 265 [2018-02-04 03:28:22,870 INFO L226 Difference]: Without dead ends: 265 [2018-02-04 03:28:22,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:28:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-04 03:28:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 220. [2018-02-04 03:28:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 03:28:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2018-02-04 03:28:22,873 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 52 [2018-02-04 03:28:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:22,873 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2018-02-04 03:28:22,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:28:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2018-02-04 03:28:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 03:28:22,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:22,874 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:22,874 INFO L371 AbstractCegarLoop]: === Iteration 36 === [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-02-04 03:28:22,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1813720883, now seen corresponding path program 1 times [2018-02-04 03:28:22,875 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:22,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:22,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:22,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:28:22,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:22,924 INFO L182 omatonBuilderFactory]: Interpolants [14368#(not (= |main_~#list~0.base| main_~x~0.base)), 14369#(not |main_#t~short28|), 14360#true, 14361#false, 14362#(= |main_~#list~0.offset| 0), 14363#(= |main_~#list~0.offset| |main_#t~malloc21.offset|), 14364#(= |main_~#list~0.offset| main_~n~0.offset), 14365#(= |main_~#list~0.offset| main_~x~0.offset), 14366#(and (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)), 14367#(or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|)))] [2018-02-04 03:28:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:22,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:28:22,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:28:22,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:28:22,924 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand 10 states. [2018-02-04 03:28:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:23,160 INFO L93 Difference]: Finished difference Result 235 states and 269 transitions. [2018-02-04 03:28:23,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:28:23,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-02-04 03:28:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:23,161 INFO L225 Difference]: With dead ends: 235 [2018-02-04 03:28:23,162 INFO L226 Difference]: Without dead ends: 235 [2018-02-04 03:28:23,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:28:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-04 03:28:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 220. [2018-02-04 03:28:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 03:28:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 250 transitions. [2018-02-04 03:28:23,166 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 250 transitions. Word has length 54 [2018-02-04 03:28:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:23,166 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 250 transitions. [2018-02-04 03:28:23,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:28:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 250 transitions. [2018-02-04 03:28:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:28:23,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:23,167 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:23,167 INFO L371 AbstractCegarLoop]: === Iteration 37 === [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-02-04 03:28:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash -824497909, now seen corresponding path program 1 times [2018-02-04 03:28:23,168 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:23,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 03:28:23,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:23,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 03:28:23,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 03:28:23,200 INFO L182 omatonBuilderFactory]: Interpolants [14842#true, 14843#false, 14844#(= |#valid| |old(#valid)|), 14845#(= |old(#valid)| (store |#valid| |main_~#list~0.base| (select (store |#valid| |main_~#list~0.base| 0) |main_~#list~0.base|)))] [2018-02-04 03:28:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 03:28:23,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:28:23,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:28:23,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:28:23,201 INFO L87 Difference]: Start difference. First operand 220 states and 250 transitions. Second operand 4 states. [2018-02-04 03:28:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:23,342 INFO L93 Difference]: Finished difference Result 227 states and 258 transitions. [2018-02-04 03:28:23,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:28:23,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-02-04 03:28:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:23,344 INFO L225 Difference]: With dead ends: 227 [2018-02-04 03:28:23,344 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 03:28:23,344 INFO L554 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-02-04 03:28:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 03:28:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-02-04 03:28:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 03:28:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions. [2018-02-04 03:28:23,348 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 55 [2018-02-04 03:28:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:23,348 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions. [2018-02-04 03:28:23,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:28:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2018-02-04 03:28:23,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 03:28:23,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:23,349 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:23,349 INFO L371 AbstractCegarLoop]: === Iteration 38 === [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-02-04 03:28:23,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1266934701, now seen corresponding path program 1 times [2018-02-04 03:28:23,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:23,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:23,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:23,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:28:23,595 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:23,595 INFO L182 omatonBuilderFactory]: Interpolants [15271#true, 15272#false, 15273#(= |main_~#list~0.offset| 0), 15274#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 15275#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| |main_#t~malloc21.offset|)), 15276#(or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))), 15277#(and (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1) (= main_~tail~0.base (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset))), 15278#(and (or (= main_~tail~0.base (select (select (store |#memory_$Pointer$.base| main_~tail~0.base (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base)) main_~n~0.base) main_~n~0.offset)) (= main_~n~0.base main_~tail~0.base)) (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1)), 15279#(or (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset)) (and (not (= main_~tail~0.base main_~x~0.base)) (= (select |#valid| main_~x~0.base) 1) (= main_~tail~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15280#(or (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset)) (and (not (= main_~x~0.base |main_#t~malloc21.base|)) (not (= main_~tail~0.base main_~x~0.base)) (= main_~tail~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 15281#(or (and (not (= main_~tail~0.base main_~x~0.base)) (= main_~tail~0.base (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset main_~tail~0.base)) main_~x~0.base) main_~x~0.offset)) (not (= main_~n~0.base main_~x~0.base))) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))), 15282#(or (and (= main_~tail~0.base (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0)) main_~x~0.base) main_~x~0.offset)) (not (= main_~tail~0.base main_~x~0.base))) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))), 15283#(or (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset)) (= main_~tail~0.base (select (select (store |#memory_$Pointer$.base| main_~tail~0.base (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base)) main_~x~0.base) main_~x~0.offset))), 15284#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))), 15285#(and (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)), 15286#(or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))), 15287#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 15288#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|))), 15289#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| remove_~x.base) remove_~x.offset))), 15290#(= 1 (select |#valid| |remove_#t~mem6.base|))] [2018-02-04 03:28:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:23,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 03:28:23,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 03:28:23,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:28:23,596 INFO L87 Difference]: Start difference. First operand 196 states and 221 transitions. Second operand 20 states. [2018-02-04 03:28:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:24,551 INFO L93 Difference]: Finished difference Result 217 states and 252 transitions. [2018-02-04 03:28:24,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:28:24,551 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-02-04 03:28:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:24,552 INFO L225 Difference]: With dead ends: 217 [2018-02-04 03:28:24,552 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 03:28:24,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:28:24,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 03:28:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 181. [2018-02-04 03:28:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-04 03:28:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 204 transitions. [2018-02-04 03:28:24,555 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 204 transitions. Word has length 53 [2018-02-04 03:28:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:24,555 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 204 transitions. [2018-02-04 03:28:24,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 03:28:24,555 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 204 transitions. [2018-02-04 03:28:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:28:24,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:24,556 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:24,556 INFO L371 AbstractCegarLoop]: === Iteration 39 === [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-02-04 03:28:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash -657032047, now seen corresponding path program 1 times [2018-02-04 03:28:24,556 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:24,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:28:24,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:24,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:28:24,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:24,722 INFO L182 omatonBuilderFactory]: Interpolants [15720#true, 15721#false, 15722#(and (not (= 0 |main_~#list~0.base|)) (= |main_~#list~0.offset| 0)), 15723#(and (= main_~tail~0.base |main_~#list~0.base|) (not (= 0 main_~tail~0.base)) (= |main_~#list~0.offset| 0)), 15724#(and (= main_~tail~0.base |main_~#list~0.base|) (not (= 0 main_~tail~0.base)) (= |main_~#list~0.offset| |main_#t~malloc21.offset|)), 15725#(and (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))) (not (= 0 main_~tail~0.base))), 15726#(and (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset)))), 15727#(and (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))) (or (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~tail~0.base (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base)) main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~tail~0.base))), 15728#(or (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset)))), 15729#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))), 15730#(and (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)), 15731#(or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))), 15732#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 15733#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 15734#(and (= remove_~x.base |remove_#in~x.base|) (= remove_~x.offset |remove_#in~x.offset|) (= (select |#memory_$Pointer$.base| remove_~x.base) (select |old(#memory_$Pointer$.base)| remove_~x.base))), 15735#(= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|) |remove_#t~mem5.base|), 15736#(= 0 (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|))] [2018-02-04 03:28:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:28:24,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:28:24,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:28:24,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:28:24,723 INFO L87 Difference]: Start difference. First operand 181 states and 204 transitions. Second operand 17 states. [2018-02-04 03:28:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:25,341 INFO L93 Difference]: Finished difference Result 232 states and 271 transitions. [2018-02-04 03:28:25,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:28:25,341 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-02-04 03:28:25,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:25,342 INFO L225 Difference]: With dead ends: 232 [2018-02-04 03:28:25,342 INFO L226 Difference]: Without dead ends: 232 [2018-02-04 03:28:25,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:28:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-04 03:28:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 185. [2018-02-04 03:28:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-04 03:28:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 209 transitions. [2018-02-04 03:28:25,344 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 209 transitions. Word has length 55 [2018-02-04 03:28:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:25,345 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 209 transitions. [2018-02-04 03:28:25,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:28:25,345 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 209 transitions. [2018-02-04 03:28:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 03:28:25,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:25,345 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:25,346 INFO L371 AbstractCegarLoop]: === Iteration 40 === [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-02-04 03:28:25,346 INFO L82 PathProgramCache]: Analyzing trace with hash 882534640, now seen corresponding path program 1 times [2018-02-04 03:28:25,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:25,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:28:25,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:25,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:28:25,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:25,419 INFO L182 omatonBuilderFactory]: Interpolants [16183#true, 16184#false, 16185#(and (= remove_~x.base |remove_#in~x.base|) (= remove_~x.offset |remove_#in~x.offset|)), 16186#(and (= (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) |remove_#in~x.offset|) |remove_#t~mem5.offset|) (= (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|) |remove_#t~mem5.base|)), 16187#(and (= 0 (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) |remove_#in~x.offset|))), 16188#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 16189#(and (= 0 (select (select |#memory_$Pointer$.offset| |re_insert_#in~x.base|) |re_insert_#in~x.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |re_insert_#in~x.base|) |re_insert_#in~x.offset|))), 16190#(and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset))), 16191#(and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (= |re_insert_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset)) (= |re_insert_#t~mem12.base| (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset)))] [2018-02-04 03:28:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:28:25,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:28:25,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:28:25,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:28:25,419 INFO L87 Difference]: Start difference. First operand 185 states and 209 transitions. Second operand 9 states. [2018-02-04 03:28:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:25,551 INFO L93 Difference]: Finished difference Result 219 states and 249 transitions. [2018-02-04 03:28:25,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:28:25,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-02-04 03:28:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:25,552 INFO L225 Difference]: With dead ends: 219 [2018-02-04 03:28:25,552 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 03:28:25,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:28:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 03:28:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 201. [2018-02-04 03:28:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 03:28:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 232 transitions. [2018-02-04 03:28:25,556 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 232 transitions. Word has length 54 [2018-02-04 03:28:25,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:25,556 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 232 transitions. [2018-02-04 03:28:25,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:28:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 232 transitions. [2018-02-04 03:28:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 03:28:25,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:25,557 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:25,557 INFO L371 AbstractCegarLoop]: === Iteration 41 === [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-02-04 03:28:25,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1343788846, now seen corresponding path program 1 times [2018-02-04 03:28:25,558 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:25,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:25,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:25,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:28:25,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:25,814 INFO L182 omatonBuilderFactory]: Interpolants [16620#true, 16621#false, 16622#(= 0 |main_~#list~0.offset|), 16623#(and (= main_~tail~0.base |main_~#list~0.base|) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= 0 main_~x~0.offset)), 16624#(and (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= 1 (select |#valid| |main_~#list~0.base|)) (= 0 main_~x~0.offset)), 16625#(and (= remove_~x.base |remove_#in~x.base|) (= remove_~x.offset |remove_#in~x.offset|)), 16626#(and (= (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) |remove_#in~x.offset|) |remove_#t~mem5.offset|) (= (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|) |remove_#t~mem5.base|)), 16627#(and (= 0 (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) |remove_#in~x.offset|))), 16628#(and (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 1 (select |#valid| |main_~#list~0.base|)) (= 0 main_~x~0.offset)), 16629#(and (= 1 (select |#valid| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 16630#(and (= 0 (select (select |#memory_$Pointer$.offset| |re_insert_#in~x.base|) |re_insert_#in~x.offset|)) (= 0 |re_insert_#in~x.offset|) (= 1 (select |#valid| |re_insert_#in~x.base|)) (= 0 (select (select |#memory_$Pointer$.base| |re_insert_#in~x.base|) |re_insert_#in~x.offset|))), 16631#(and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset)) (= 1 (select |#valid| re_insert_~x.base)) (= 0 re_insert_~x.offset)), 16632#(and (or (not (= re_insert_~x.base |re_insert_#t~mem10.base|)) (= 0 (select (store (select |#memory_$Pointer$.base| |re_insert_#t~mem10.base|) |re_insert_#t~mem10.offset| re_insert_~x.base) re_insert_~x.offset)) (and (= 1 (select |#valid| re_insert_~x.base)) (= |re_insert_#t~mem10.offset| re_insert_~x.offset))) (or (not (= re_insert_~x.base |re_insert_#t~mem10.base|)) (= 0 (select (store (select |#memory_$Pointer$.offset| |re_insert_#t~mem10.base|) |re_insert_#t~mem10.offset| re_insert_~x.offset) re_insert_~x.offset))) (or (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (= re_insert_~x.base |re_insert_#t~mem10.base|)) (or (= re_insert_~x.base |re_insert_#t~mem10.base|) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset)))), 16633#(and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset))) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset)))), 16634#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset))) (= 0 |re_insert_#t~mem12.base|)) (= 0 |re_insert_#t~mem12.offset|)), 16635#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset))), 16636#(= 1 (select |#valid| |re_insert_#t~mem13.base|))] [2018-02-04 03:28:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:25,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:28:25,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:28:25,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:28:25,815 INFO L87 Difference]: Start difference. First operand 201 states and 232 transitions. Second operand 17 states. [2018-02-04 03:28:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:26,235 INFO L93 Difference]: Finished difference Result 220 states and 252 transitions. [2018-02-04 03:28:26,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 03:28:26,235 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-02-04 03:28:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:26,236 INFO L225 Difference]: With dead ends: 220 [2018-02-04 03:28:26,236 INFO L226 Difference]: Without dead ends: 220 [2018-02-04 03:28:26,236 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:28:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-04 03:28:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 201. [2018-02-04 03:28:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 03:28:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2018-02-04 03:28:26,239 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 57 [2018-02-04 03:28:26,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:26,239 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2018-02-04 03:28:26,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:28:26,239 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2018-02-04 03:28:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 03:28:26,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:26,239 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:26,239 INFO L371 AbstractCegarLoop]: === Iteration 42 === [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-02-04 03:28:26,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1343788845, now seen corresponding path program 1 times [2018-02-04 03:28:26,240 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:26,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:28:26,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:26,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 03:28:26,566 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:26,567 INFO L182 omatonBuilderFactory]: Interpolants [17088#(and (= main_~x~0.offset |main_~#list~0.offset|) (= 0 |main_~#list~0.offset|) (<= 8 (select |#length| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 17089#(and (<= 8 (select |#length| main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= 0 main_~x~0.offset)), 17090#(and (= 0 (select (select |#memory_$Pointer$.offset| |re_insert_#in~x.base|) |re_insert_#in~x.offset|)) (= 0 |re_insert_#in~x.offset|) (<= 8 (select |#length| |re_insert_#in~x.base|)) (= 0 (select (select |#memory_$Pointer$.base| |re_insert_#in~x.base|) |re_insert_#in~x.offset|))), 17091#(and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset)) (<= 8 (select |#length| re_insert_~x.base)) (= 0 re_insert_~x.offset)), 17092#(and (or (not (= re_insert_~x.base |re_insert_#t~mem10.base|)) (and (= 0 (select (store (select |#memory_$Pointer$.offset| |re_insert_#t~mem10.base|) |re_insert_#t~mem10.offset| re_insert_~x.offset) re_insert_~x.offset)) (= 0 (select (store (select |#memory_$Pointer$.base| |re_insert_#t~mem10.base|) |re_insert_#t~mem10.offset| re_insert_~x.base) re_insert_~x.offset))) (and (= |re_insert_#t~mem10.offset| re_insert_~x.offset) (<= 8 (select |#length| re_insert_~x.base)) (= 0 re_insert_~x.offset))) (or (= re_insert_~x.base |re_insert_#t~mem10.base|) (and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset))))), 17093#(or (and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset)))) (and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset)))), 17094#(or (and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset)))) (and (= 0 |re_insert_#t~mem12.base|) (= 0 |re_insert_#t~mem12.offset|))), 17095#(and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset)))), 17096#(and (= |re_insert_#t~mem13.offset| 0) (<= 8 (select |#length| |re_insert_#t~mem13.base|))), 17080#true, 17081#false, 17082#(= 0 |main_~#list~0.offset|), 17083#(and (= main_~x~0.offset |main_~#list~0.offset|) (= 0 |main_~#list~0.offset|)), 17084#(and (= remove_~x.base |remove_#in~x.base|) (= remove_~x.offset |remove_#in~x.offset|)), 17085#(and (= remove_~x.base |remove_#in~x.base|) (= remove_~x.offset |remove_#in~x.offset|) (or (not (= remove_~x.offset 0)) (<= (+ remove_~x.offset 8) (select |#length| remove_~x.base)))), 17086#(and (or (<= 8 (select |#length| |remove_#in~x.base|)) (not (= |remove_#in~x.offset| 0))) (= (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) |remove_#in~x.offset|) |remove_#t~mem5.offset|) (= (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|) |remove_#t~mem5.base|)), 17087#(and (or (<= 8 (select |#length| |remove_#in~x.base|)) (not (= |remove_#in~x.offset| 0))) (= 0 (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) |remove_#in~x.offset|)))] [2018-02-04 03:28:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 03:28:26,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:28:26,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:28:26,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:28:26,568 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 17 states. [2018-02-04 03:28:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:26,985 INFO L93 Difference]: Finished difference Result 216 states and 247 transitions. [2018-02-04 03:28:26,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:28:26,985 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-02-04 03:28:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:26,986 INFO L225 Difference]: With dead ends: 216 [2018-02-04 03:28:26,986 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 03:28:26,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:28:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 03:28:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 201. [2018-02-04 03:28:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 03:28:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 230 transitions. [2018-02-04 03:28:26,990 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 230 transitions. Word has length 57 [2018-02-04 03:28:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:26,990 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 230 transitions. [2018-02-04 03:28:26,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:28:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 230 transitions. [2018-02-04 03:28:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 03:28:26,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:26,991 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:26,991 INFO L371 AbstractCegarLoop]: === Iteration 43 === [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-02-04 03:28:26,991 INFO L82 PathProgramCache]: Analyzing trace with hash -439652661, now seen corresponding path program 1 times [2018-02-04 03:28:26,992 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:27,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:27,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:27,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:28:27,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:27,496 INFO L182 omatonBuilderFactory]: Interpolants [17536#(and (or (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset)) (and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_~#list~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))) (= |main_~#list~0.offset| 0)), 17537#(and (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)), 17538#(or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))), 17539#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_~#list~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= |main_~#list~0.offset| 0)), 17540#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 17541#(and (= remove_~x.base |remove_#in~x.base|) (= (select |#memory_$Pointer$.offset| remove_~x.base) (select |old(#memory_$Pointer$.offset)| remove_~x.base)) (= remove_~x.offset |remove_#in~x.offset|) (= (select |#memory_$Pointer$.base| remove_~x.base) (select |old(#memory_$Pointer$.base)| remove_~x.base))), 17542#(and (= remove_~x.base |remove_#in~x.base|) (= (select |#memory_$Pointer$.offset| remove_~x.base) (select |old(#memory_$Pointer$.offset)| remove_~x.base)) (= (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)) |remove_#t~mem1.base|) (= remove_~x.offset |remove_#in~x.offset|) (= (select |#memory_$Pointer$.base| remove_~x.base) (select |old(#memory_$Pointer$.base)| remove_~x.base)) (= (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)) |remove_#t~mem1.offset|)), 17543#(and (= remove_~x.base |remove_#in~x.base|) (= (select |#memory_$Pointer$.offset| remove_~x.base) (select |old(#memory_$Pointer$.offset)| remove_~x.base)) (= remove_~x.offset |remove_#in~x.offset|) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4))) (= (select |#memory_$Pointer$.base| remove_~x.base) (select |old(#memory_$Pointer$.base)| remove_~x.base))), 17544#(and (or (= |remove_#t~mem6.offset| 0) (and (= (select (select |#memory_$Pointer$.offset| remove_~x.base) remove_~x.offset) |remove_#t~mem6.offset|) (= remove_~x.base |remove_#in~x.base|) (= (select |#memory_$Pointer$.offset| remove_~x.base) (select |old(#memory_$Pointer$.offset)| remove_~x.base)) (= remove_~x.offset |remove_#in~x.offset|))) (or (not (= |remove_#t~mem6.offset| 0)) (and (= remove_~x.base |remove_#in~x.base|) (= remove_~x.offset |remove_#in~x.offset|) (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4))) (= |remove_#t~mem6.base| (select (select |#memory_$Pointer$.base| remove_~x.base) remove_~x.offset)) (= (select |#memory_$Pointer$.base| remove_~x.base) (select |old(#memory_$Pointer$.base)| remove_~x.base))))), 17545#(and (or (and (= |remove_#t~mem6.base| (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|)) (= 0 |remove_#t~mem8.offset|) (= 0 |remove_#t~mem8.base|)) (not (= |remove_#t~mem6.offset| 0))) (or (= |remove_#t~mem6.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |remove_#in~x.base|) |remove_#in~x.offset|) |remove_#t~mem6.offset|))), 17546#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |remove_#in~x.base|) |remove_#in~x.offset|) 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|)) (+ (- 0) 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|)) (+ (- 0) 4))))), 17547#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= |main_~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))), 17548#(and (= 0 |is_list_containing_x_#in~l.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) (+ 0 4)))), 17549#(and (= 0 (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (= is_list_containing_x_~l.offset 0)), 17550#(and (= 0 (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (= |is_list_containing_x_#t~mem15.base| (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4))) (= is_list_containing_x_~l.offset 0) (= |is_list_containing_x_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) (+ is_list_containing_x_~l.offset 4)))), 17528#true, 17529#false, 17530#(= |main_~#list~0.offset| 0), 17531#(and (= main_~tail~0.base |main_~#list~0.base|) (= 0 main_~tail~0.offset) (= |main_~#list~0.offset| 0)), 17532#(and (= main_~tail~0.base |main_~#list~0.base|) (= 0 main_~tail~0.offset) (= |main_~#list~0.offset| |main_#t~malloc21.offset|) (= |main_~#list~0.offset| 0)), 17533#(and (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))) (or (and (= main_~tail~0.base |main_~#list~0.base|) (= 0 main_~tail~0.offset)) (= main_~n~0.base main_~tail~0.base)) (= |main_~#list~0.offset| 0)), 17534#(and (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))) (or (and (= (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset) |main_~#list~0.base|) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset))) (= main_~n~0.base main_~tail~0.base)) (= |main_~#list~0.offset| 0)), 17535#(and (or (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_~#list~0.base|))) (= |main_~#list~0.offset| 0))] [2018-02-04 03:28:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:27,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:28:27,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:28:27,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:28:27,497 INFO L87 Difference]: Start difference. First operand 201 states and 230 transitions. Second operand 23 states. [2018-02-04 03:28:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:28,912 INFO L93 Difference]: Finished difference Result 261 states and 308 transitions. [2018-02-04 03:28:28,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 03:28:28,913 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 59 [2018-02-04 03:28:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:28,913 INFO L225 Difference]: With dead ends: 261 [2018-02-04 03:28:28,914 INFO L226 Difference]: Without dead ends: 261 [2018-02-04 03:28:28,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=271, Invalid=1985, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 03:28:28,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-02-04 03:28:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 219. [2018-02-04 03:28:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 03:28:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 254 transitions. [2018-02-04 03:28:28,930 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 254 transitions. Word has length 59 [2018-02-04 03:28:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:28,931 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 254 transitions. [2018-02-04 03:28:28,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:28:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 254 transitions. [2018-02-04 03:28:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 03:28:28,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:28,931 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:28,931 INFO L371 AbstractCegarLoop]: === Iteration 44 === [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-02-04 03:28:28,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1340641402, now seen corresponding path program 1 times [2018-02-04 03:28:28,932 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:28,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:28:29,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:29,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:28:29,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:29,202 INFO L182 omatonBuilderFactory]: Interpolants [18083#true, 18084#false, 18085#(and (not (= 0 |main_~#list~0.base|)) (= |main_~#list~0.offset| 0)), 18086#(and (= main_~tail~0.base |main_~#list~0.base|) (not (= 0 main_~tail~0.base)) (= |main_~#list~0.offset| 0)), 18087#(and (= main_~tail~0.base |main_~#list~0.base|) (not (= 0 main_~tail~0.base)) (= |main_~#list~0.offset| |main_#t~malloc21.offset|)), 18088#(and (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))) (not (= 0 main_~tail~0.base))), 18089#(and (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))) (not (= 0 (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset))) (= (select |#valid| main_~n~0.base) 1)), 18090#(and (or (not (= main_~n~0.base main_~tail~0.base)) (and (= main_~n~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset))) (or (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~tail~0.base (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base)) main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~tail~0.base)) (= (select |#valid| main_~n~0.base) 1)), 18091#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~tail~0.base main_~x~0.base)) (= (select |#valid| main_~x~0.base) 1)) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))), 18092#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base |main_#t~malloc21.base|)) (not (= main_~tail~0.base main_~x~0.base))) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))), 18093#(or (and (not (= main_~tail~0.base main_~x~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset main_~tail~0.base)) main_~x~0.base) main_~x~0.offset))) (not (= main_~n~0.base main_~x~0.base))) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))), 18094#(or (and (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0)) main_~x~0.base) main_~x~0.offset))) (not (= main_~tail~0.base main_~x~0.base))) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))), 18095#(or (not (= 0 (select (select (store |#memory_$Pointer$.base| main_~tail~0.base (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base)) main_~x~0.base) main_~x~0.offset))) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))), 18096#(or (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset))), 18097#(and (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)), 18098#(or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))), 18099#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 18100#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 18101#(and (= remove_~x.base |remove_#in~x.base|) (= remove_~x.offset |remove_#in~x.offset|) (= (select |#memory_$Pointer$.base| remove_~x.base) (select |old(#memory_$Pointer$.base)| remove_~x.base))), 18102#(= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|) |remove_#t~mem5.base|), 18103#(= 0 (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|))] [2018-02-04 03:28:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:28:29,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:28:29,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:28:29,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:28:29,202 INFO L87 Difference]: Start difference. First operand 219 states and 254 transitions. Second operand 21 states. [2018-02-04 03:28:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:30,198 INFO L93 Difference]: Finished difference Result 228 states and 259 transitions. [2018-02-04 03:28:30,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:28:30,198 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-04 03:28:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:30,199 INFO L225 Difference]: With dead ends: 228 [2018-02-04 03:28:30,199 INFO L226 Difference]: Without dead ends: 226 [2018-02-04 03:28:30,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:28:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-04 03:28:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 203. [2018-02-04 03:28:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 03:28:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 230 transitions. [2018-02-04 03:28:30,202 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 230 transitions. Word has length 64 [2018-02-04 03:28:30,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:30,202 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 230 transitions. [2018-02-04 03:28:30,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:28:30,202 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 230 transitions. [2018-02-04 03:28:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 03:28:30,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:30,203 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:30,203 INFO L371 AbstractCegarLoop]: === Iteration 45 === [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-02-04 03:28:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1851422202, now seen corresponding path program 1 times [2018-02-04 03:28:30,204 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:30,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 03:28:30,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:30,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:28:30,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:30,277 INFO L182 omatonBuilderFactory]: Interpolants [18566#true, 18567#false, 18568#(and (= 0 |main_#t~malloc21.offset|) (= 8 (select |#length| |main_#t~malloc21.base|))), 18569#(and (= 0 main_~n~0.offset) (= 8 (select |#length| main_~n~0.base))), 18570#(and (= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 18571#(and (= 0 |re_insert_#in~x.offset|) (= 8 (select |#length| |re_insert_#in~x.base|))), 18572#(and (= re_insert_~x.offset 0) (= (select |#length| re_insert_~x.base) 8))] [2018-02-04 03:28:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 03:28:30,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:28:30,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:28:30,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:28:30,278 INFO L87 Difference]: Start difference. First operand 203 states and 230 transitions. Second operand 7 states. [2018-02-04 03:28:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:30,481 INFO L93 Difference]: Finished difference Result 207 states and 233 transitions. [2018-02-04 03:28:30,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:28:30,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-02-04 03:28:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:30,482 INFO L225 Difference]: With dead ends: 207 [2018-02-04 03:28:30,482 INFO L226 Difference]: Without dead ends: 207 [2018-02-04 03:28:30,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:28:30,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-04 03:28:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199. [2018-02-04 03:28:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-04 03:28:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 225 transitions. [2018-02-04 03:28:30,484 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 225 transitions. Word has length 66 [2018-02-04 03:28:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:30,485 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 225 transitions. [2018-02-04 03:28:30,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:28:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2018-02-04 03:28:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 03:28:30,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:30,485 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:30,485 INFO L371 AbstractCegarLoop]: === Iteration 46 === [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-02-04 03:28:30,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1851422201, now seen corresponding path program 1 times [2018-02-04 03:28:30,486 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:30,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:30,510 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 03:28:30,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:30,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:30,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:30,511 INFO L182 omatonBuilderFactory]: Interpolants [18992#(= 1 (select |#valid| re_insert_~x.base)), 18987#true, 18988#false, 18989#(= (select |#valid| main_~n~0.base) 1), 18990#(= 1 (select |#valid| main_~x~0.base)), 18991#(= 1 (select |#valid| |re_insert_#in~x.base|))] [2018-02-04 03:28:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 03:28:30,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:28:30,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:28:30,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:28:30,512 INFO L87 Difference]: Start difference. First operand 199 states and 225 transitions. Second operand 6 states. [2018-02-04 03:28:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:30,687 INFO L93 Difference]: Finished difference Result 228 states and 270 transitions. [2018-02-04 03:28:30,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:28:30,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-02-04 03:28:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:30,688 INFO L225 Difference]: With dead ends: 228 [2018-02-04 03:28:30,688 INFO L226 Difference]: Without dead ends: 228 [2018-02-04 03:28:30,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:28:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-04 03:28:30,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 198. [2018-02-04 03:28:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 03:28:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 224 transitions. [2018-02-04 03:28:30,691 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 224 transitions. Word has length 66 [2018-02-04 03:28:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:30,691 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 224 transitions. [2018-02-04 03:28:30,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:28:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 224 transitions. [2018-02-04 03:28:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 03:28:30,692 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:30,692 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:28:30,692 INFO L371 AbstractCegarLoop]: === Iteration 47 === [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-02-04 03:28:30,692 INFO L82 PathProgramCache]: Analyzing trace with hash 992263742, now seen corresponding path program 1 times [2018-02-04 03:28:30,693 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:30,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:28:31,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:31,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 03:28:31,389 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 03:28:31,390 INFO L182 omatonBuilderFactory]: Interpolants [19424#true, 19425#false, 19426#(= |main_~#list~0.offset| 0), 19427#(and (= |main_~#list~0.offset| 0) (= 1 (select |#valid| |main_~#list~0.base|))), 19428#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= (select |#valid| |main_~#list~0.base|) 1) (= |main_~#list~0.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))), 19429#(and (= main_~tail~0.base main_~x~0.base) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (= (select |#valid| |main_~#list~0.base|) 1) (= |main_~#list~0.offset| 0)), 19430#(and (not (= |main_~#list~0.base| |main_#t~malloc21.base|)) (or (not (= |main_~#list~0.offset| main_~tail~0.offset)) (and (not (= 0 |main_#t~malloc21.base|)) (= main_~tail~0.base main_~x~0.base))) (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= main_~tail~0.base main_~x~0.base) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 19431#(and (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (not (= |main_~#list~0.base| main_~n~0.base)) (or (and (not (= 0 main_~n~0.base)) (= main_~tail~0.base main_~x~0.base)) (not (= |main_~#list~0.offset| main_~tail~0.offset))) (= |main_~#list~0.offset| 0) (or (= |main_~#list~0.offset| main_~tail~0.offset) (and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~n~0.base (store (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset main_~tail~0.offset)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))) (= main_~tail~0.base main_~x~0.base) (= 0 (select (select (store |#memory_$Pointer$.base| main_~n~0.base (store (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset main_~tail~0.base)) |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))))), 19432#(and (or (and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4))))) (and (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4))))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 19433#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 19434#(and (or (not (= remove_~x.offset 0)) (and (= remove_~x.base |remove_#in~x.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 19435#(and (or (not (= remove_~x.offset 0)) (and (= |remove_#t~mem1.base| (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))) (= remove_~x.base |remove_#in~x.base|) (= |remove_#t~mem1.offset| (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 19436#(and (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0)) (or (and (= remove_~x.base |remove_#in~x.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (and (not (= (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)) 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)))))) (not (= remove_~x.offset 0)))), 19437#(and (or (not (= remove_~x.offset 0)) (and (= remove_~x.base |remove_#in~x.base|) (or (not (= remove_~x.base |remove_#t~mem2.base|)) (= (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4)) |remove_#in~x.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (and (not (= (select (select |#memory_$Pointer$.offset| remove_~x.base) (+ remove_~x.offset 4)) 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 (select (select |#memory_$Pointer$.base| remove_~x.base) (+ remove_~x.offset 4))))))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 19438#(and (or (and (= remove_~x.base |remove_#in~x.base|) (or (not (= 0 (select (select |old(#memory_$Pointer$.base)| remove_~x.base) (+ remove_~x.offset 4)))) (not (= (select (select |old(#memory_$Pointer$.offset)| |remove_#in~x.base|) (+ remove_~x.offset 4)) 0))) (or (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ remove_~x.offset 4)) |remove_#in~x.base|) (= (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (select |#memory_$Pointer$.base| remove_~x.base)))) (not (= remove_~x.offset 0))) (or (= |remove_#in~x.offset| remove_~x.offset) (= remove_~x.offset 0))), 19439#(or (not (= |remove_#in~x.offset| 0)) (and (or (not (= 0 (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ (- 0) 4)))) (not (= (select (select |old(#memory_$Pointer$.offset)| |remove_#in~x.base|) (+ (- 0) 4)) 0))) (or (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (+ (- 0) 4)) |remove_#in~x.base|) (= (select |#memory_$Pointer$.base| |remove_#in~x.base|) (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|))))), 19440#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4)))) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 19441#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4)))) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 19442#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|), 19443#(not (= |__VERIFIER_assert_#in~cond| 0)), 19444#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 19445#(and (= (select |old(#memory_$Pointer$.base)| re_insert_~x.base) (select |#memory_$Pointer$.base| re_insert_~x.base)) (or (= re_insert_~x.offset 0) (= |re_insert_#in~x.offset| re_insert_~x.offset)) (= re_insert_~x.base |re_insert_#in~x.base|)), 19446#(and (= (select |old(#memory_$Pointer$.base)| re_insert_~x.base) (select |#memory_$Pointer$.base| re_insert_~x.base)) (= (select (select |#memory_$Pointer$.base| re_insert_~x.base) (+ re_insert_~x.offset 4)) |re_insert_#t~mem9.base|) (or (= re_insert_~x.offset 0) (= |re_insert_#in~x.offset| re_insert_~x.offset)) (= re_insert_~x.base |re_insert_#in~x.base|)), 19447#(and (= (select |old(#memory_$Pointer$.base)| re_insert_~x.base) (select |#memory_$Pointer$.base| re_insert_~x.base)) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) (+ re_insert_~x.offset 4))) (or (= re_insert_~x.offset 0) (= |re_insert_#in~x.offset| re_insert_~x.offset)) (= re_insert_~x.base |re_insert_#in~x.base|)), 19448#(or (= 0 (select (select |old(#memory_$Pointer$.base)| |re_insert_#in~x.base|) (+ (- 0) 4))) (not (= |re_insert_#in~x.offset| 0)))] [2018-02-04 03:28:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 03:28:31,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:28:31,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:28:31,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:28:31,390 INFO L87 Difference]: Start difference. First operand 198 states and 224 transitions. Second operand 25 states. [2018-02-04 03:28:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:32,328 INFO L93 Difference]: Finished difference Result 217 states and 244 transitions. [2018-02-04 03:28:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:28:32,329 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 68 [2018-02-04 03:28:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:32,329 INFO L225 Difference]: With dead ends: 217 [2018-02-04 03:28:32,329 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 03:28:32,330 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=205, Invalid=1517, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 03:28:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 03:28:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2018-02-04 03:28:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 03:28:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions. [2018-02-04 03:28:32,332 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 68 [2018-02-04 03:28:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:32,332 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions. [2018-02-04 03:28:32,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:28:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2018-02-04 03:28:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 03:28:32,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:32,332 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:32,332 INFO L371 AbstractCegarLoop]: === Iteration 48 === [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-02-04 03:28:32,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2092949312, now seen corresponding path program 1 times [2018-02-04 03:28:32,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:32,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:28:32,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:32,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:28:32,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:32,484 INFO L182 omatonBuilderFactory]: Interpolants [19904#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ |main_~#list~0.offset| 4)))) (= |main_~#list~0.offset| 0)), 19905#(and (or (and (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)) (not (= is_list_containing_x_~l.offset 0))) (or (= is_list_containing_x_~l.offset 0) (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~l.offset))), 19906#(or (and (= (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) (+ (- 0) 4)) |is_list_containing_x_#t~mem16.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)) (not (= |is_list_containing_x_#in~l.offset| 0))), 19907#(and (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (= |is_list_containing_x_#in~l.base| is_list_containing_x_~l.base)), 19908#(= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|), 19909#(or (not (= |is_list_containing_x_#in~l.offset| 0)) (= (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) (+ (- 0) 4)) |is_list_containing_x_#in~x.base|)), 19896#true, 19897#false, 19898#(= |main_~#list~0.offset| 0), 19899#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= |main_~#list~0.offset| 0)), 19900#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= (select |#valid| main_~n~0.base) 1) (= |main_~#list~0.offset| 0)), 19901#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= (select |#valid| main_~x~0.base) 1) (= |main_~#list~0.offset| 0)), 19902#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (not (= main_~x~0.base |main_#t~malloc21.base|)) (= |main_~#list~0.offset| 0)), 19903#(and (not (= main_~x~0.base main_~n~0.base)) (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~tail~0.offset) (= |main_~#list~0.offset| 0))] [2018-02-04 03:28:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 03:28:32,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:28:32,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:28:32,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:28:32,484 INFO L87 Difference]: Start difference. First operand 196 states and 221 transitions. Second operand 14 states. [2018-02-04 03:28:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:32,955 INFO L93 Difference]: Finished difference Result 246 states and 294 transitions. [2018-02-04 03:28:32,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:28:32,955 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2018-02-04 03:28:32,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:32,956 INFO L225 Difference]: With dead ends: 246 [2018-02-04 03:28:32,956 INFO L226 Difference]: Without dead ends: 241 [2018-02-04 03:28:32,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2018-02-04 03:28:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-02-04 03:28:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 196. [2018-02-04 03:28:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 03:28:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 220 transitions. [2018-02-04 03:28:32,959 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 220 transitions. Word has length 68 [2018-02-04 03:28:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:32,959 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 220 transitions. [2018-02-04 03:28:32,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:28:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 220 transitions. [2018-02-04 03:28:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 03:28:32,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:32,960 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:32,960 INFO L371 AbstractCegarLoop]: === Iteration 49 === [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-02-04 03:28:32,960 INFO L82 PathProgramCache]: Analyzing trace with hash -251124913, now seen corresponding path program 1 times [2018-02-04 03:28:32,960 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:32,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:28:33,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:33,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 03:28:33,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:33,441 INFO L182 omatonBuilderFactory]: Interpolants [20384#(and (= main_~n~0.offset 0) (or (= main_~n~0.base |main_~#list~0.base|) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_~#list~0.base|))) (= |main_~#list~0.offset| 0)), 20385#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_~#list~0.base|)) (= main_~x~0.base |main_~#list~0.base|)) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 20386#(and (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)), 20387#(or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))), 20388#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 20389#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20390#(and (= (select |#memory_$Pointer$.offset| remove_~x.base) (select |old(#memory_$Pointer$.offset)| remove_~x.base)) (= |remove_#in~x.base| remove_~x.base) (= remove_~x.offset |remove_#in~x.offset|) (= (select |#memory_$Pointer$.base| remove_~x.base) (select |old(#memory_$Pointer$.base)| remove_~x.base))), 20391#(and (or (not (= remove_~x.base |remove_#t~mem6.base|)) (and (= |remove_#in~x.base| (select (select |#memory_$Pointer$.base| remove_~x.base) remove_~x.offset)) (= remove_~x.offset |remove_#in~x.offset|))) (= remove_~x.base |remove_#in~x.base|) (= (select |#memory_$Pointer$.base| remove_~x.base) (select |old(#memory_$Pointer$.base)| remove_~x.base)) (or (= (select |#memory_$Pointer$.offset| remove_~x.base) (select |old(#memory_$Pointer$.offset)| remove_~x.base)) (= remove_~x.base |remove_#t~mem6.base|))), 20392#(or (= |remove_#in~x.base| (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|)) (and (= (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) (select (store |#memory_$Pointer$.base| |remove_#t~mem6.base| (store (select |#memory_$Pointer$.base| |remove_#t~mem6.base|) (+ |remove_#t~mem6.offset| 4) |remove_#t~mem8.base|)) |remove_#in~x.base|)) (= (select (store |#memory_$Pointer$.offset| |remove_#t~mem6.base| (store (select |#memory_$Pointer$.offset| |remove_#t~mem6.base|) (+ |remove_#t~mem6.offset| 4) |remove_#t~mem8.offset|)) |remove_#in~x.base|) (select |old(#memory_$Pointer$.offset)| |remove_#in~x.base|)))), 20393#(or (and (= (select |#memory_$Pointer$.offset| |remove_#in~x.base|) (select |old(#memory_$Pointer$.offset)| |remove_#in~x.base|)) (= (select |#memory_$Pointer$.base| |remove_#in~x.base|) (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|))) (= |remove_#in~x.base| (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|))), 20394#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ |main_~#list~0.offset| 4))) (= |main_~#list~0.offset| 0) (= 0 main_~x~0.offset)), 20395#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) (+ 0 4))) (= 0 main_~x~0.offset)), 20396#(and (= 0 |re_insert_#in~x.offset|) (= 0 (select (select |#memory_$Pointer$.base| |re_insert_#in~x.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| |re_insert_#in~x.base|) (+ 0 4)))), 20397#(and (= re_insert_~x.offset 0) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) (+ re_insert_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) (+ re_insert_~x.offset 4)))), 20398#(and (= |re_insert_#t~mem9.base| (select (select |#memory_$Pointer$.base| re_insert_~x.base) (+ re_insert_~x.offset 4))) (= re_insert_~x.offset 0) (= 0 (select (select |#memory_$Pointer$.base| re_insert_~x.base) (+ re_insert_~x.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) (+ re_insert_~x.offset 4))) (= |re_insert_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| re_insert_~x.base) (+ re_insert_~x.offset 4)))), 20376#true, 20377#false, 20378#(= |main_~#list~0.offset| 0), 20379#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 20380#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| |main_#t~malloc21.offset|) (= |main_~#list~0.offset| 0)), 20381#(and (= main_~tail~0.base |main_~#list~0.base|) (= main_~n~0.offset 0) (= |main_~#list~0.offset| 0)), 20382#(and (= main_~n~0.offset 0) (or (= main_~n~0.base |main_~#list~0.base|) (not (= main_~n~0.base main_~tail~0.base))) (or (= (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset) |main_~#list~0.base|) (= main_~n~0.base main_~tail~0.base)) (= |main_~#list~0.offset| 0)), 20383#(and (= main_~n~0.offset 0) (or (= main_~n~0.base main_~tail~0.base) (and (= (select (select (store |#memory_$Pointer$.base| main_~tail~0.base (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base)) main_~n~0.base) main_~n~0.offset) |main_~#list~0.base|) (= 0 (select (select (store |#memory_$Pointer$.base| main_~tail~0.base (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base)) main_~n~0.base) (+ main_~n~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~tail~0.base (store (select |#memory_$Pointer$.offset| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.offset)) main_~n~0.base) (+ main_~n~0.offset 4))))) (or (= main_~n~0.base |main_~#list~0.base|) (not (= main_~n~0.base main_~tail~0.base))) (= |main_~#list~0.offset| 0))] [2018-02-04 03:28:33,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:28:33,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 03:28:33,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 03:28:33,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-02-04 03:28:33,442 INFO L87 Difference]: Start difference. First operand 196 states and 220 transitions. Second operand 23 states. [2018-02-04 03:28:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:34,300 INFO L93 Difference]: Finished difference Result 206 states and 234 transitions. [2018-02-04 03:28:34,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:28:34,300 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-02-04 03:28:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:34,301 INFO L225 Difference]: With dead ends: 206 [2018-02-04 03:28:34,301 INFO L226 Difference]: Without dead ends: 206 [2018-02-04 03:28:34,302 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=1350, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:28:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-04 03:28:34,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2018-02-04 03:28:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-04 03:28:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2018-02-04 03:28:34,304 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 69 [2018-02-04 03:28:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:34,304 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2018-02-04 03:28:34,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 03:28:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2018-02-04 03:28:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 03:28:34,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:34,305 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:34,305 INFO L371 AbstractCegarLoop]: === Iteration 50 === [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-02-04 03:28:34,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1536756980, now seen corresponding path program 1 times [2018-02-04 03:28:34,306 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:34,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 03:28:34,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:28:34,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:28:34,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:34,347 INFO L182 omatonBuilderFactory]: Interpolants [20832#(= 0 |is_list_containing_x_#t~ret17|), 20833#(= |main_#t~ret26| 0), 20829#true, 20830#false, 20831#(= 0 |is_list_containing_x_#res|)] [2018-02-04 03:28:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 03:28:34,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:28:34,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:28:34,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:28:34,348 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand 5 states. [2018-02-04 03:28:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:34,353 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2018-02-04 03:28:34,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:28:34,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-02-04 03:28:34,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:34,354 INFO L225 Difference]: With dead ends: 187 [2018-02-04 03:28:34,354 INFO L226 Difference]: Without dead ends: 170 [2018-02-04 03:28:34,355 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:28:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-04 03:28:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 164. [2018-02-04 03:28:34,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-04 03:28:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 179 transitions. [2018-02-04 03:28:34,357 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 179 transitions. Word has length 70 [2018-02-04 03:28:34,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:34,358 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 179 transitions. [2018-02-04 03:28:34,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:28:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 179 transitions. [2018-02-04 03:28:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 03:28:34,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:34,359 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:34,359 INFO L371 AbstractCegarLoop]: === Iteration 51 === [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-02-04 03:28:34,359 INFO L82 PathProgramCache]: Analyzing trace with hash -804247907, now seen corresponding path program 1 times [2018-02-04 03:28:34,359 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:34,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:28:34,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:34,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 03:28:34,647 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:34,647 INFO L182 omatonBuilderFactory]: Interpolants [21185#true, 21186#false, 21187#(= |main_~#list~0.offset| 0), 21188#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| 0)), 21189#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| |main_#t~malloc21.offset|)), 21190#(and (= main_~tail~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset)), 21191#(and (= (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset) |main_~#list~0.base|) (= |main_~#list~0.offset| main_~n~0.offset) (= main_~tail~0.base (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset))), 21192#(and (or (and (= (select (select (store |#memory_$Pointer$.base| main_~tail~0.base (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base)) main_~n~0.base) main_~n~0.offset) |main_~#list~0.base|) (= main_~tail~0.base (select (select (store |#memory_$Pointer$.base| main_~tail~0.base (store (select |#memory_$Pointer$.base| main_~tail~0.base) (+ main_~tail~0.offset 4) main_~n~0.base)) main_~n~0.base) main_~n~0.offset))) (= main_~n~0.base main_~tail~0.base)) (= |main_~#list~0.offset| main_~n~0.offset) (or (= main_~n~0.base |main_~#list~0.base|) (not (= main_~n~0.base main_~tail~0.base)))), 21193#(and (= |main_~#list~0.offset| main_~n~0.offset) (or (= main_~n~0.base |main_~#list~0.base|) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_~#list~0.base|)))), 21194#(and (= |main_~#list~0.offset| main_~x~0.offset) (or (and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_~#list~0.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))) (= main_~x~0.base |main_~#list~0.base|))), 21195#(and (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)), 21196#(or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))), 21197#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 21198#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 21199#(and (= |remove_#in~x.base| remove_~x.base) (= remove_~x.offset |remove_#in~x.offset|) (= (select |#memory_$Pointer$.base| remove_~x.base) (select |old(#memory_$Pointer$.base)| remove_~x.base))), 21200#(and (= remove_~x.base |remove_#in~x.base|) (or (not (= remove_~x.base |remove_#t~mem6.base|)) (= |remove_#in~x.base| (select (select |#memory_$Pointer$.base| remove_~x.base) remove_~x.offset))) (= remove_~x.offset |remove_#in~x.offset|) (= (select |#memory_$Pointer$.base| remove_~x.base) (select |old(#memory_$Pointer$.base)| remove_~x.base))), 21201#(or (= |remove_#in~x.base| (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|) (select (select (store |#memory_$Pointer$.base| |remove_#t~mem6.base| (store (select |#memory_$Pointer$.base| |remove_#t~mem6.base|) (+ |remove_#t~mem6.offset| 4) |remove_#t~mem8.base|)) |remove_#in~x.base|) |remove_#in~x.offset|))), 21202#(or (= |remove_#in~x.base| (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|) (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|))), 21203#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 21204#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |re_insert_#in~x.base|) |re_insert_#in~x.offset|))), 21205#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset))), 21206#(= 1 (select |#valid| |re_insert_#t~mem13.base|))] [2018-02-04 03:28:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:28:34,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:28:34,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:28:34,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:28:34,648 INFO L87 Difference]: Start difference. First operand 164 states and 179 transitions. Second operand 22 states. [2018-02-04 03:28:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:35,440 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2018-02-04 03:28:35,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:28:35,440 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-02-04 03:28:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:35,441 INFO L225 Difference]: With dead ends: 173 [2018-02-04 03:28:35,441 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 03:28:35,441 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1359, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 03:28:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 03:28:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2018-02-04 03:28:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-04 03:28:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2018-02-04 03:28:35,443 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 71 [2018-02-04 03:28:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:35,443 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2018-02-04 03:28:35,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:28:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2018-02-04 03:28:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 03:28:35,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:35,444 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:28:35,444 INFO L371 AbstractCegarLoop]: === Iteration 52 === [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-02-04 03:28:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash -804247906, now seen corresponding path program 1 times [2018-02-04 03:28:35,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:28:35,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:28:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:28:35,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:28:35,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 03:28:35,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:28:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:28:35,797 INFO L182 omatonBuilderFactory]: Interpolants [21600#(and (= |re_insert_#t~mem13.offset| 0) (= (select |#length| |re_insert_#t~mem13.base|) 8)), 21580#true, 21581#false, 21582#(and (= 8 (select |#length| |main_~#list~0.base|)) (= |main_~#list~0.offset| 0)), 21583#(and (= main_~tail~0.base |main_~#list~0.base|) (= 8 (select |#length| |main_~#list~0.base|)) (= 0 main_~tail~0.offset) (= |main_~#list~0.offset| 0)), 21584#(and (= main_~tail~0.base |main_~#list~0.base|) (= 0 main_~tail~0.offset) (= |main_~#list~0.offset| |main_#t~malloc21.offset|) (or (= |main_~#list~0.base| |main_#t~malloc21.base|) (= 8 (select |#length| main_~tail~0.base)))), 21585#(and (or (and (= main_~tail~0.base |main_~#list~0.base|) (= 8 (select |#length| main_~tail~0.base)) (= 0 main_~tail~0.offset)) (= main_~n~0.base main_~tail~0.base)) (= |main_~#list~0.offset| main_~n~0.offset) (or (= main_~n~0.base |main_~#list~0.base|) (not (= main_~n~0.base main_~tail~0.base)))), 21586#(and (= |main_~#list~0.offset| main_~n~0.offset) (or (= main_~n~0.base |main_~#list~0.base|) (not (= main_~n~0.base main_~tail~0.base))) (or (and (= (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset) |main_~#list~0.base|) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset)) (or (= main_~n~0.base |main_~#list~0.base|) (and (= 8 (select |#length| main_~tail~0.base)) (= main_~tail~0.base (select (store (select |#memory_$Pointer$.base| main_~n~0.base) (+ main_~n~0.offset 4) 0) main_~n~0.offset))))) (= main_~n~0.base main_~tail~0.base))), 21587#(and (or (= main_~n~0.base |main_~#list~0.base|) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~n~0.base) main_~n~0.offset) |main_~#list~0.base|))) (= |main_~#list~0.offset| main_~n~0.offset)), 21588#(and (or (and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_~#list~0.base|) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.base |main_~#list~0.base|)) (= |main_~#list~0.offset| main_~x~0.offset)), 21589#(and (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|)), 21590#(or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))), 21591#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base))), 21592#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 21593#(and (= (select |#memory_$Pointer$.offset| remove_~x.base) (select |old(#memory_$Pointer$.offset)| remove_~x.base)) (= |remove_#in~x.base| remove_~x.base) (= remove_~x.offset |remove_#in~x.offset|) (= (select |#memory_$Pointer$.base| remove_~x.base) (select |old(#memory_$Pointer$.base)| remove_~x.base))), 21594#(and (= remove_~x.base |remove_#in~x.base|) (or (not (= remove_~x.base |remove_#t~mem6.base|)) (= |remove_#in~x.base| (select (select |#memory_$Pointer$.base| remove_~x.base) remove_~x.offset))) (= remove_~x.offset |remove_#in~x.offset|) (= (select |#memory_$Pointer$.base| remove_~x.base) (select |old(#memory_$Pointer$.base)| remove_~x.base)) (or (= (select |#memory_$Pointer$.offset| remove_~x.base) (select |old(#memory_$Pointer$.offset)| remove_~x.base)) (= remove_~x.base |remove_#t~mem6.base|))), 21595#(or (and (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|) (select (select (store |#memory_$Pointer$.base| |remove_#t~mem6.base| (store (select |#memory_$Pointer$.base| |remove_#t~mem6.base|) (+ |remove_#t~mem6.offset| 4) |remove_#t~mem8.base|)) |remove_#in~x.base|) |remove_#in~x.offset|)) (= (select (select |old(#memory_$Pointer$.offset)| |remove_#in~x.base|) |remove_#in~x.offset|) (select (select (store |#memory_$Pointer$.offset| |remove_#t~mem6.base| (store (select |#memory_$Pointer$.offset| |remove_#t~mem6.base|) (+ |remove_#t~mem6.offset| 4) |remove_#t~mem8.offset|)) |remove_#in~x.base|) |remove_#in~x.offset|))) (= |remove_#in~x.base| (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|))), 21596#(or (= |remove_#in~x.base| (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|)) (and (= (select (select |old(#memory_$Pointer$.base)| |remove_#in~x.base|) |remove_#in~x.offset|) (select (select |#memory_$Pointer$.base| |remove_#in~x.base|) |remove_#in~x.offset|)) (= (select (select |old(#memory_$Pointer$.offset)| |remove_#in~x.base|) |remove_#in~x.offset|) (select (select |#memory_$Pointer$.offset| |remove_#in~x.base|) |remove_#in~x.offset|)))), 21597#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 21598#(and (= 0 (select (select |#memory_$Pointer$.offset| |re_insert_#in~x.base|) |re_insert_#in~x.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |re_insert_#in~x.base|) |re_insert_#in~x.offset|)))), 21599#(and (= 0 (select (select |#memory_$Pointer$.offset| re_insert_~x.base) re_insert_~x.offset)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| re_insert_~x.base) re_insert_~x.offset))))] [2018-02-04 03:28:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 03:28:35,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:28:35,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:28:35,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:28:35,798 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand 21 states. [2018-02-04 03:28:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:28:36,909 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-02-04 03:28:36,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:28:36,909 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2018-02-04 03:28:36,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:28:36,910 INFO L225 Difference]: With dead ends: 175 [2018-02-04 03:28:36,910 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 03:28:36,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 03:28:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 03:28:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 162. [2018-02-04 03:28:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-04 03:28:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2018-02-04 03:28:36,912 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 71 [2018-02-04 03:28:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:28:36,912 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2018-02-04 03:28:36,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:28:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2018-02-04 03:28:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 03:28:36,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:28:36,912 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 03:28:36,912 INFO L371 AbstractCegarLoop]: === Iteration 53 === [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-02-04 03:28:36,913 INFO L82 PathProgramCache]: Analyzing trace with hash -470070624, now seen corresponding path program 1 times [2018-02-04 03:28:36,913 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:28:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:28:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 03:28:36,951 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 03:28:36,971 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 03:28:36,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:28:36 BoogieIcfgContainer [2018-02-04 03:28:36,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:28:36,989 INFO L168 Benchmark]: Toolchain (without parser) took 34192.42 ms. Allocated memory was 404.2 MB in the beginning and 1.1 GB in the end (delta: 663.7 MB). Free memory was 358.3 MB in the beginning and 533.2 MB in the end (delta: -175.0 MB). Peak memory consumption was 488.8 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:36,990 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:28:36,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.32 ms. Allocated memory is still 404.2 MB. Free memory was 358.3 MB in the beginning and 347.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:36,991 INFO L168 Benchmark]: Boogie Preprocessor took 29.06 ms. Allocated memory is still 404.2 MB. Free memory was 347.7 MB in the beginning and 345.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:36,991 INFO L168 Benchmark]: RCFGBuilder took 487.21 ms. Allocated memory is still 404.2 MB. Free memory was 345.0 MB in the beginning and 311.5 MB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:36,991 INFO L168 Benchmark]: TraceAbstraction took 33467.27 ms. Allocated memory was 404.2 MB in the beginning and 1.1 GB in the end (delta: 663.7 MB). Free memory was 311.5 MB in the beginning and 533.2 MB in the end (delta: -221.7 MB). Peak memory consumption was 442.0 MB. Max. memory is 5.3 GB. [2018-02-04 03:28:36,992 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.17 ms. Allocated memory is still 404.2 MB. Free memory is still 367.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.32 ms. Allocated memory is still 404.2 MB. Free memory was 358.3 MB in the beginning and 347.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.06 ms. Allocated memory is still 404.2 MB. Free memory was 347.7 MB in the beginning and 345.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 487.21 ms. Allocated memory is still 404.2 MB. Free memory was 345.0 MB in the beginning and 311.5 MB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 33467.27 ms. Allocated memory was 404.2 MB in the beginning and 1.1 GB in the end (delta: 663.7 MB). Free memory was 311.5 MB in the beginning and 533.2 MB in the end (delta: -221.7 MB). Peak memory consumption was 442.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 587]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 587. Possible FailurePath: [L589] FCALL struct node list; VAL [list={12:0}] [L590] FCALL list.L=0 VAL [list={12:0}] [L591] FCALL list.R=0 VAL [list={12:0}] [L592] struct node *x=&list, *tail=&list; VAL [list={12:0}, tail={12:0}, x={12:0}] [L593] COND TRUE __VERIFIER_nondet_bool() [L595] EXPR, FCALL malloc(sizeof(struct node)) VAL [list={12:0}, malloc(sizeof(struct node))={11:0}, tail={12:0}, x={12:0}] [L595] struct node *n=malloc(sizeof(struct node)); VAL [list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L596] COND FALSE !(n==0) VAL [list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L598] FCALL n->L=tail VAL [list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L599] FCALL n->R=0 VAL [list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L600] FCALL tail->R=n VAL [list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L601] COND FALSE !(__VERIFIER_nondet_bool()) [L593] COND FALSE !(__VERIFIER_nondet_bool()) [L604] CALL is_list_containing_x(&list, x) VAL [l={12:0}, x={12:0}] [L581] COND TRUE l==x [L582] RET return 1; VAL [\result=1, l={12:0}, l={12:0}, x={12:0}, x={12:0}] [L604] is_list_containing_x(&list, x) VAL [is_list_containing_x(&list, x)=1, list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L605] CALL remove(x) VAL [x={12:0}] [L567] FCALL x->R VAL [x={12:0}, x={12:0}, x->R={11:0}] [L567] COND TRUE x->R [L568] EXPR, FCALL x->R VAL [x={12:0}, x={12:0}, x->R={11:0}] [L568] EXPR, FCALL x->L VAL [x={12:0}, x={12:0}, x->L={0:0}, x->R={11:0}] [L568] FCALL x->R->L=x->L VAL [x={12:0}, x={12:0}, x->L={0:0}, x->R={11:0}] [L569] FCALL x->L VAL [x={12:0}, x={12:0}, x->L={0:0}] [L569] COND FALSE, RET !(x->L) [L605] remove(x) VAL [list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L606] EXPR &list==x || !is_list_containing_x(&list, x) VAL [&list==x || !is_list_containing_x(&list, x)=1, list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L606] CALL __VERIFIER_assert(&list==x || !is_list_containing_x(&list, x)) VAL [\old(cond)=1] [L5] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L606] __VERIFIER_assert(&list==x || !is_list_containing_x(&list, x)) VAL [&list==x || !is_list_containing_x(&list, x)=1, list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L607] CALL re_insert(x) VAL [x={12:0}] [L574] FCALL x->R VAL [x={12:0}, x={12:0}, x->R={11:0}] [L574] COND TRUE x->R [L575] EXPR, FCALL x->R VAL [x={12:0}, x={12:0}, x->R={11:0}] [L575] FCALL x->R->L=x VAL [x={12:0}, x={12:0}, x->R={11:0}] [L576] FCALL x->L VAL [x={12:0}, x={12:0}, x->L={0:0}] [L576] COND FALSE, RET !(x->L) [L607] re_insert(x) VAL [list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L608] CALL, EXPR is_list_containing_x(&list, x) VAL [l={12:0}, x={12:0}] [L581] COND TRUE l==x [L582] RET return 1; VAL [\result=1, l={12:0}, l={12:0}, x={12:0}, x={12:0}] [L608] EXPR is_list_containing_x(&list, x) VAL [is_list_containing_x(&list, x)=1, list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L608] CALL __VERIFIER_assert(is_list_containing_x(&list, x)) VAL [\old(cond)=1] [L5] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L608] __VERIFIER_assert(is_list_containing_x(&list, x)) VAL [is_list_containing_x(&list, x)=1, list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L609] return 0; VAL [\result=0, list={12:0}, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] [L609] return 0; VAL [\result=0, malloc(sizeof(struct node))={11:0}, n={11:0}, tail={12:0}, x={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 122 locations, 43 error locations. UNSAFE Result, 33.4s OverallTime, 53 OverallIterations, 4 TraceHistogramMax, 22.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5558 SDtfs, 5756 SDslu, 25189 SDs, 0 SdLazy, 25891 SolverSat, 3476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1038 GetRequests, 106 SyntacticMatches, 54 SemanticMatches, 878 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4563 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 246/385 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 52 MinimizatonAttempts, 1134 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2215 NumberOfCodeBlocks, 2215 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2092 ConstructedInterpolants, 0 QuantifiedInterpolants, 1127075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 24 PerfectInterpolantSequences, 246/385 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-28-36-998.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dancing_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-28-36-998.csv Received shutdown request...