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/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:16:42,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:16:42,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:16:42,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:16:42,170 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:16:42,171 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:16:42,172 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:16:42,173 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:16:42,175 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:16:42,175 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:16:42,176 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:16:42,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:16:42,177 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:16:42,178 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:16:42,179 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:16:42,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:16:42,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:16:42,184 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:16:42,185 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:16:42,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:16:42,188 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:16:42,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:16:42,188 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:16:42,189 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:16:42,190 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:16:42,191 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:16:42,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:16:42,192 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:16:42,192 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:16:42,192 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:16:42,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:16:42,193 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-02 20:16:42,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:16:42,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:16:42,204 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:16:42,204 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:16:42,205 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:16:42,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:16:42,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:16:42,205 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:16:42,205 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:16:42,206 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:16:42,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:16:42,206 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:16:42,206 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:16:42,206 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:16:42,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:16:42,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:16:42,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:16:42,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:16:42,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:16:42,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:16:42,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:16:42,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:16:42,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:16:42,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:16:42,249 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:16:42,257 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:16:42,258 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:16:42,260 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:16:42,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i [2018-02-02 20:16:42,411 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:16:42,412 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:16:42,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:16:42,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:16:42,419 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:16:42,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:16:42" (1/1) ... [2018-02-02 20:16:42,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294b662f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:16:42, skipping insertion in model container [2018-02-02 20:16:42,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:16:42" (1/1) ... [2018-02-02 20:16:42,436 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:16:42,466 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:16:42,562 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:16:42,576 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:16:42,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:16:42 WrapperNode [2018-02-02 20:16:42,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:16:42,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:16:42,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:16:42,584 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:16:42,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:16:42" (1/1) ... [2018-02-02 20:16:42,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:16:42" (1/1) ... [2018-02-02 20:16:42,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:16:42" (1/1) ... [2018-02-02 20:16:42,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:16:42" (1/1) ... [2018-02-02 20:16:42,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:16:42" (1/1) ... [2018-02-02 20:16:42,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:16:42" (1/1) ... [2018-02-02 20:16:42,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:16:42" (1/1) ... [2018-02-02 20:16:42,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:16:42,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:16:42,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:16:42,611 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:16:42,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:16:42" (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-02 20:16:42,649 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:16:42,649 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:16:42,649 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-02-02 20:16:42,649 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-02-02 20:16:42,649 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 20:16:42,649 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:16:42,649 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:16:42,649 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:16:42,650 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:16:42,650 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:16:42,650 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:16:42,650 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:16:42,650 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:16:42,650 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:16:42,650 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:16:42,650 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:16:42,650 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-02-02 20:16:42,650 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-02-02 20:16:42,650 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 20:16:42,650 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:16:42,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:16:42,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:16:42,975 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:16:42,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:16:42 BoogieIcfgContainer [2018-02-02 20:16:42,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:16:42,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:16:42,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:16:42,978 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:16:42,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:16:42" (1/3) ... [2018-02-02 20:16:42,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2955ae3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:16:42, skipping insertion in model container [2018-02-02 20:16:42,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:16:42" (2/3) ... [2018-02-02 20:16:42,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2955ae3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:16:42, skipping insertion in model container [2018-02-02 20:16:42,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:16:42" (3/3) ... [2018-02-02 20:16:42,981 INFO L107 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_true-valid-memsafety.i [2018-02-02 20:16:42,986 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:16:42,995 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-02-02 20:16:43,019 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:16:43,020 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:16:43,020 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:16:43,020 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:16:43,020 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:16:43,020 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:16:43,020 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:16:43,021 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:16:43,021 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:16:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2018-02-02 20:16:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 20:16:43,040 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:43,041 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:16:43,041 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:43,044 INFO L82 PathProgramCache]: Analyzing trace with hash -548983798, now seen corresponding path program 1 times [2018-02-02 20:16:43,079 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:43,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:43,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-02 20:16:43,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:43,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:16:43,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:43,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-02 20:16:43,152 INFO L182 omatonBuilderFactory]: Interpolants [124#true, 125#false, 126#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 20:16:43,152 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-02 20:16:43,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:16:43,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:16:43,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:16:43,163 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2018-02-02 20:16:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:43,350 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-02-02 20:16:43,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:16:43,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 20:16:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:43,358 INFO L225 Difference]: With dead ends: 123 [2018-02-02 20:16:43,358 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 20:16:43,359 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-02 20:16:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 20:16:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-02-02 20:16:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 20:16:43,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-02 20:16:43,395 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 7 [2018-02-02 20:16:43,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:43,396 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-02 20:16:43,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:16:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-02 20:16:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 20:16:43,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:43,397 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:16:43,397 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash -548983797, now seen corresponding path program 1 times [2018-02-02 20:16:43,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:43,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:43,445 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-02 20:16:43,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:43,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:16:43,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:43,446 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-02 20:16:43,446 INFO L182 omatonBuilderFactory]: Interpolants [368#false, 369#(and (= (select |#length| |main_~#list~0.base|) 4) (= |main_~#list~0.offset| 0)), 367#true] [2018-02-02 20:16:43,446 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-02 20:16:43,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:16:43,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:16:43,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:16:43,448 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 3 states. [2018-02-02 20:16:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:43,542 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-02-02 20:16:43,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:16:43,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 20:16:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:43,544 INFO L225 Difference]: With dead ends: 118 [2018-02-02 20:16:43,544 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 20:16:43,545 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-02 20:16:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 20:16:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-02-02 20:16:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 20:16:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-02-02 20:16:43,553 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 7 [2018-02-02 20:16:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:43,553 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-02-02 20:16:43,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:16:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-02-02 20:16:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:16:43,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:43,554 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:16:43,554 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:43,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977305, now seen corresponding path program 1 times [2018-02-02 20:16:43,555 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:43,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:43,614 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-02 20:16:43,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:43,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:16:43,614 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:43,615 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-02 20:16:43,615 INFO L182 omatonBuilderFactory]: Interpolants [608#(= 1 (select |#valid| append_~pointerToList.base)), 604#true, 605#false, 606#(= 1 (select |#valid| |main_~#list~0.base|)), 607#(= 1 (select |#valid| |append_#in~pointerToList.base|))] [2018-02-02 20:16:43,615 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-02 20:16:43,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:16:43,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:16:43,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:43,615 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 5 states. [2018-02-02 20:16:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:43,741 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-02 20:16:43,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:16:43,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 20:16:43,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:43,742 INFO L225 Difference]: With dead ends: 129 [2018-02-02 20:16:43,742 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 20:16:43,743 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-02 20:16:43,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 20:16:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2018-02-02 20:16:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:16:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-02-02 20:16:43,747 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 14 [2018-02-02 20:16:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:43,747 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-02-02 20:16:43,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:16:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-02-02 20:16:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:16:43,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:43,747 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:16:43,747 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977306, now seen corresponding path program 1 times [2018-02-02 20:16:43,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:43,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:43,827 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-02 20:16:43,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:43,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:16:43,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:43,828 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-02 20:16:43,828 INFO L182 omatonBuilderFactory]: Interpolants [864#(and (= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|)), 865#(and (= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (= (select |#valid| |main_~#list~0.base|) 1)), 866#(and (= 0 |append_#in~pointerToList.offset|) (= (select |#valid| |append_#in~pointerToList.base|) 1) (= 4 (select |#length| |append_#in~pointerToList.base|))), 867#(and (= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0) (= (select |#valid| append_~pointerToList.base) 1)), 868#(and (= append_~pointerToList.offset 0) (= (select |#length| append_~pointerToList.base) 4)), 862#true, 863#false] [2018-02-02 20:16:43,828 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-02 20:16:43,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:16:43,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:16:43,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:16:43,829 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-02-02 20:16:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:44,018 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-02-02 20:16:44,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:16:44,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 20:16:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:44,022 INFO L225 Difference]: With dead ends: 127 [2018-02-02 20:16:44,022 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 20:16:44,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:16:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 20:16:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-02-02 20:16:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:16:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-02-02 20:16:44,028 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2018-02-02 20:16:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:44,028 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-02-02 20:16:44,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:16:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-02-02 20:16:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:16:44,029 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:44,029 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:16:44,029 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash 150721727, now seen corresponding path program 1 times [2018-02-02 20:16:44,030 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:44,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:44,060 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-02 20:16:44,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:44,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:16:44,061 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:44,061 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-02 20:16:44,061 INFO L182 omatonBuilderFactory]: Interpolants [1120#true, 1121#false, 1122#(= 1 (select |#valid| |append_#t~malloc14.base|)), 1123#(= 1 (select |#valid| append_~node~0.base))] [2018-02-02 20:16:44,061 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-02 20:16:44,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:16:44,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:16:44,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:16:44,062 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 4 states. [2018-02-02 20:16:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:44,150 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-02 20:16:44,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:16:44,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 20:16:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:44,152 INFO L225 Difference]: With dead ends: 121 [2018-02-02 20:16:44,152 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 20:16:44,152 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:44,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 20:16:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-02 20:16:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 20:16:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-02-02 20:16:44,160 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 15 [2018-02-02 20:16:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:44,160 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-02-02 20:16:44,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:16:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-02-02 20:16:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 20:16:44,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:44,161 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:16:44,161 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:44,161 INFO L82 PathProgramCache]: Analyzing trace with hash 150721728, now seen corresponding path program 1 times [2018-02-02 20:16:44,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:44,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:44,218 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-02 20:16:44,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:44,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:16:44,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:44,219 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-02 20:16:44,219 INFO L182 omatonBuilderFactory]: Interpolants [1368#true, 1369#false, 1370#(and (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 1371#(and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.offset 0))] [2018-02-02 20:16:44,219 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-02 20:16:44,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:16:44,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:16:44,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:16:44,219 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 4 states. [2018-02-02 20:16:44,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:44,286 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-02-02 20:16:44,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:16:44,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 20:16:44,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:44,287 INFO L225 Difference]: With dead ends: 120 [2018-02-02 20:16:44,287 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 20:16:44,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:44,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 20:16:44,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-02 20:16:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 20:16:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-02 20:16:44,290 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 15 [2018-02-02 20:16:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:44,290 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-02 20:16:44,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:16:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-02 20:16:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:16:44,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:44,290 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] [2018-02-02 20:16:44,290 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:44,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099981, now seen corresponding path program 1 times [2018-02-02 20:16:44,291 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:44,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:44,326 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-02 20:16:44,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:44,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:16:44,327 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:44,327 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-02 20:16:44,327 INFO L182 omatonBuilderFactory]: Interpolants [1616#(= 1 (select |#valid| |append_#t~malloc14.base|)), 1617#(= 1 (select |#valid| append_~node~0.base)), 1618#(= |#valid| |old(#valid)|), 1614#true, 1615#false] [2018-02-02 20:16:44,328 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-02 20:16:44,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:16:44,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:16:44,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:44,328 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 5 states. [2018-02-02 20:16:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:44,429 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-02-02 20:16:44,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:16:44,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 20:16:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:44,432 INFO L225 Difference]: With dead ends: 135 [2018-02-02 20:16:44,432 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 20:16:44,432 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-02 20:16:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 20:16:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-02-02 20:16:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 20:16:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-02-02 20:16:44,437 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 22 [2018-02-02 20:16:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:44,437 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-02-02 20:16:44,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:16:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-02-02 20:16:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:16:44,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:44,438 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] [2018-02-02 20:16:44,438 INFO L371 AbstractCegarLoop]: === Iteration 8 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099982, now seen corresponding path program 1 times [2018-02-02 20:16:44,439 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:44,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:44,486 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-02 20:16:44,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:44,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:16:44,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:44,487 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-02 20:16:44,488 INFO L182 omatonBuilderFactory]: Interpolants [1879#true, 1880#false, 1881#(and (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 1882#(and (= append_~node~0.offset 0) (= 8 (select |#length| append_~node~0.base))), 1883#(= |old(#length)| |#length|)] [2018-02-02 20:16:44,488 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-02 20:16:44,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:16:44,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:16:44,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:44,489 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 5 states. [2018-02-02 20:16:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:44,593 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2018-02-02 20:16:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:16:44,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 20:16:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:44,594 INFO L225 Difference]: With dead ends: 129 [2018-02-02 20:16:44,594 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 20:16:44,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:16:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 20:16:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-02-02 20:16:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 20:16:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-02 20:16:44,598 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 22 [2018-02-02 20:16:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:44,599 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-02 20:16:44,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:16:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-02 20:16:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:16:44,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:44,600 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] [2018-02-02 20:16:44,600 INFO L371 AbstractCegarLoop]: === Iteration 9 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash 4873111, now seen corresponding path program 1 times [2018-02-02 20:16:44,601 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:44,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:44,646 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-02 20:16:44,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:44,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:16:44,646 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:44,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-02 20:16:44,647 INFO L182 omatonBuilderFactory]: Interpolants [2138#true, 2139#false, 2140#(= 1 (select |#valid| |create_data_#t~malloc1.base|)), 2141#(= 1 (select |#valid| create_data_~data~0.base))] [2018-02-02 20:16:44,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-02 20:16:44,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:16:44,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:16:44,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:16:44,648 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 4 states. [2018-02-02 20:16:44,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:44,733 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 20:16:44,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:16:44,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 20:16:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:44,735 INFO L225 Difference]: With dead ends: 119 [2018-02-02 20:16:44,735 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 20:16:44,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 20:16:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 20:16:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 20:16:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-02 20:16:44,739 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 23 [2018-02-02 20:16:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:44,739 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-02 20:16:44,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:16:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-02 20:16:44,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:16:44,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:44,740 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] [2018-02-02 20:16:44,740 INFO L371 AbstractCegarLoop]: === Iteration 10 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:44,740 INFO L82 PathProgramCache]: Analyzing trace with hash 4873112, now seen corresponding path program 1 times [2018-02-02 20:16:44,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:44,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:44,783 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-02 20:16:44,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:44,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:16:44,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:44,784 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-02 20:16:44,784 INFO L182 omatonBuilderFactory]: Interpolants [2384#(and (= 8 (select |#length| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 2385#(and (= create_data_~data~0.offset 0) (= (select |#length| create_data_~data~0.base) 8)), 2382#true, 2383#false] [2018-02-02 20:16:44,784 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-02 20:16:44,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:16:44,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:16:44,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:16:44,785 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-02-02 20:16:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:44,847 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-02-02 20:16:44,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:16:44,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 20:16:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:44,848 INFO L225 Difference]: With dead ends: 123 [2018-02-02 20:16:44,849 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 20:16:44,849 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 20:16:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-02-02 20:16:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 20:16:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-02 20:16:44,852 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 23 [2018-02-02 20:16:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:44,852 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-02 20:16:44,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:16:44,853 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-02 20:16:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:16:44,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:44,853 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-02 20:16:44,853 INFO L371 AbstractCegarLoop]: === Iteration 11 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:44,853 INFO L82 PathProgramCache]: Analyzing trace with hash 167210254, now seen corresponding path program 1 times [2018-02-02 20:16:44,854 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:44,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:44,885 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-02 20:16:44,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:44,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:16:44,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:44,885 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-02 20:16:44,886 INFO L182 omatonBuilderFactory]: Interpolants [2631#true, 2632#false, 2633#(= 1 (select |#valid| append_~pointerToList.base)), 2634#(= |#valid| |old(#valid)|)] [2018-02-02 20:16:44,886 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-02 20:16:44,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:16:44,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:16:44,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:16:44,887 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 4 states. [2018-02-02 20:16:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:44,952 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-02-02 20:16:44,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:16:44,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-02-02 20:16:44,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:44,953 INFO L225 Difference]: With dead ends: 128 [2018-02-02 20:16:44,953 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 20:16:44,954 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-02 20:16:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 20:16:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-02-02 20:16:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:16:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-02-02 20:16:44,957 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 24 [2018-02-02 20:16:44,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:44,957 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-02-02 20:16:44,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:16:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-02-02 20:16:44,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:16:44,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:44,958 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-02 20:16:44,958 INFO L371 AbstractCegarLoop]: === Iteration 12 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash 167210255, now seen corresponding path program 1 times [2018-02-02 20:16:44,959 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:44,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:45,026 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-02 20:16:45,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:45,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:16:45,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:45,027 INFO L182 omatonBuilderFactory]: Interpolants [2885#true, 2886#false, 2887#(= 0 |main_~#list~0.offset|), 2888#(= 0 |append_#in~pointerToList.offset|), 2889#(= append_~pointerToList.offset 0), 2890#(and (< 0 (+ append_~pointerToList.offset 1)) (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base))), 2891#(= |old(#length)| |#length|)] [2018-02-02 20:16:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:45,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:16:45,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:16:45,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:16:45,028 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-02-02 20:16:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:45,185 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-02-02 20:16:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:16:45,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 20:16:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:45,186 INFO L225 Difference]: With dead ends: 122 [2018-02-02 20:16:45,186 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 20:16:45,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:16:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 20:16:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-02-02 20:16:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:16:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-02-02 20:16:45,189 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2018-02-02 20:16:45,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:45,189 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-02-02 20:16:45,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:16:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-02-02 20:16:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:16:45,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:45,189 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-02 20:16:45,191 INFO L371 AbstractCegarLoop]: === Iteration 13 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:45,191 INFO L82 PathProgramCache]: Analyzing trace with hash 151037655, now seen corresponding path program 1 times [2018-02-02 20:16:45,192 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:45,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:45,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-02 20:16:45,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:45,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:16:45,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:45,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-02 20:16:45,237 INFO L182 omatonBuilderFactory]: Interpolants [3144#true, 3145#false, 3146#(and (= 8 (select |#length| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|) (= (select |#valid| |create_data_#t~malloc1.base|) 1)), 3147#(and (= create_data_~data~0.offset 0) (= 8 (select |#length| create_data_~data~0.base)) (= (select |#valid| create_data_~data~0.base) 1)), 3148#(and (= create_data_~data~0.offset 0) (= (select |#length| create_data_~data~0.base) 8))] [2018-02-02 20:16:45,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-02 20:16:45,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:16:45,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:16:45,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:45,238 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 5 states. [2018-02-02 20:16:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:45,357 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 20:16:45,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:16:45,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 20:16:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:45,359 INFO L225 Difference]: With dead ends: 119 [2018-02-02 20:16:45,359 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 20:16:45,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:16:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 20:16:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-02 20:16:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 20:16:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-02-02 20:16:45,362 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 24 [2018-02-02 20:16:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:45,363 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-02-02 20:16:45,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:16:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-02-02 20:16:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:16:45,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:45,364 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] [2018-02-02 20:16:45,364 INFO L371 AbstractCegarLoop]: === Iteration 14 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:45,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005000, now seen corresponding path program 1 times [2018-02-02 20:16:45,365 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:45,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:45,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-02 20:16:45,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:45,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:16:45,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:45,442 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-02 20:16:45,442 INFO L182 omatonBuilderFactory]: Interpolants [3392#(and (or (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 3393#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 3387#true, 3388#false, 3389#(= 1 (select |#valid| append_~node~0.base)), 3390#(= |#valid| |old(#valid)|), 3391#(= |#valid| (store |old(#valid)| |create_data_#t~malloc1.base| (select |#valid| |create_data_#t~malloc1.base|)))] [2018-02-02 20:16:45,442 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-02 20:16:45,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:16:45,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:16:45,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:16:45,443 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 7 states. [2018-02-02 20:16:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:45,671 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-02-02 20:16:45,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:16:45,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 20:16:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:45,672 INFO L225 Difference]: With dead ends: 131 [2018-02-02 20:16:45,672 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 20:16:45,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:16:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 20:16:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-02 20:16:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 20:16:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-02-02 20:16:45,674 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 29 [2018-02-02 20:16:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:45,674 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-02-02 20:16:45,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:16:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-02-02 20:16:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:16:45,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:45,675 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] [2018-02-02 20:16:45,675 INFO L371 AbstractCegarLoop]: === Iteration 15 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:45,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005001, now seen corresponding path program 1 times [2018-02-02 20:16:45,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:45,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:45,749 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-02 20:16:45,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:45,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:16:45,750 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:45,750 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-02 20:16:45,750 INFO L182 omatonBuilderFactory]: Interpolants [3654#true, 3655#false, 3656#(and (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 3657#(and (= append_~node~0.offset 0) (= 8 (select |#length| append_~node~0.base))), 3658#(= |old(#length)| |#length|), 3659#(and (= (select |#length| |create_data_#t~malloc1.base|) 8) (= |#length| (store |old(#length)| |create_data_#t~malloc1.base| (select |#length| |create_data_#t~malloc1.base|)))), 3660#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)))] [2018-02-02 20:16:45,750 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-02 20:16:45,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:16:45,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:16:45,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:16:45,751 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 7 states. [2018-02-02 20:16:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:45,992 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-02-02 20:16:45,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:16:45,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 20:16:45,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:45,993 INFO L225 Difference]: With dead ends: 131 [2018-02-02 20:16:45,993 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 20:16:45,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:16:45,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 20:16:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-02 20:16:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 20:16:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-02 20:16:45,997 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 29 [2018-02-02 20:16:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:45,998 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-02 20:16:45,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:16:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-02 20:16:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:16:45,998 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:45,999 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] [2018-02-02 20:16:45,999 INFO L371 AbstractCegarLoop]: === Iteration 16 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:45,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344885, now seen corresponding path program 1 times [2018-02-02 20:16:45,999 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:46,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:46,026 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-02 20:16:46,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:46,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:16:46,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:46,026 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-02 20:16:46,027 INFO L182 omatonBuilderFactory]: Interpolants [3921#true, 3922#false, 3923#(= append_~pointerToList.base |append_#in~pointerToList.base|), 3924#(= 1 (select |#valid| |append_#in~pointerToList.base|)), 3925#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 20:16:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:46,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:16:46,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:16:46,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:46,027 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 5 states. [2018-02-02 20:16:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:46,138 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-02 20:16:46,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:16:46,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 20:16:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:46,139 INFO L225 Difference]: With dead ends: 121 [2018-02-02 20:16:46,139 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 20:16:46,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:16:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 20:16:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-02 20:16:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 20:16:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-02-02 20:16:46,142 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 30 [2018-02-02 20:16:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:46,142 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-02-02 20:16:46,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:16:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-02-02 20:16:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:16:46,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:46,144 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] [2018-02-02 20:16:46,144 INFO L371 AbstractCegarLoop]: === Iteration 17 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:46,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344886, now seen corresponding path program 1 times [2018-02-02 20:16:46,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:46,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:46,221 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-02 20:16:46,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:46,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:16:46,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:46,222 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-02 20:16:46,222 INFO L182 omatonBuilderFactory]: Interpolants [4168#true, 4169#false, 4170#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 4171#(and (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= |append_#in~pointerToList.offset| append_~pointerToList.offset) (= append_~pointerToList.offset 0))), 4172#(or (<= 4 (select |#length| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.offset| 0))), 4173#(and (< 0 (+ |main_~#list~0.offset| 1)) (<= (+ |main_~#list~0.offset| 4) (select |#length| |main_~#list~0.base|)))] [2018-02-02 20:16:46,222 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-02 20:16:46,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:16:46,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:16:46,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:16:46,223 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-02-02 20:16:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:46,379 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-02 20:16:46,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:16:46,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 20:16:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:46,381 INFO L225 Difference]: With dead ends: 126 [2018-02-02 20:16:46,381 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 20:16:46,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:16:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 20:16:46,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-02-02 20:16:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 20:16:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-02 20:16:46,384 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 30 [2018-02-02 20:16:46,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:46,385 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-02 20:16:46,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:16:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-02 20:16:46,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:16:46,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:46,385 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] [2018-02-02 20:16:46,386 INFO L371 AbstractCegarLoop]: === Iteration 18 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:46,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765284, now seen corresponding path program 1 times [2018-02-02 20:16:46,386 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:46,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:46,435 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-02 20:16:46,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:46,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:16:46,435 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:46,436 INFO L182 omatonBuilderFactory]: Interpolants [4421#true, 4422#false, 4423#(= 1 (select |#valid| |create_data_#t~malloc3.base|)), 4424#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 4425#(= 1 (select |#valid| |create_data_#t~mem6.base|))] [2018-02-02 20:16:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:46,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:16:46,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:16:46,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:46,437 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 5 states. [2018-02-02 20:16:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:46,548 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-02 20:16:46,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:16:46,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 20:16:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:46,550 INFO L225 Difference]: With dead ends: 130 [2018-02-02 20:16:46,550 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 20:16:46,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:16:46,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 20:16:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2018-02-02 20:16:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 20:16:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-02-02 20:16:46,553 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 30 [2018-02-02 20:16:46,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:46,553 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-02-02 20:16:46,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:16:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-02-02 20:16:46,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:16:46,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:46,554 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] [2018-02-02 20:16:46,554 INFO L371 AbstractCegarLoop]: === Iteration 19 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:46,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765283, now seen corresponding path program 1 times [2018-02-02 20:16:46,554 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:46,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:46,623 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-02 20:16:46,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:46,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:16:46,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:46,624 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-02 20:16:46,624 INFO L182 omatonBuilderFactory]: Interpolants [4688#(and (= 0 |create_data_#t~malloc3.offset|) (= 80 (select |#length| |create_data_#t~malloc3.base|))), 4689#(and (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 4690#(and (= create_data_~counter~0 0) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 4691#(and (= |create_data_#t~mem6.offset| 0) (= create_data_~counter~0 0) (= (select |#length| |create_data_#t~mem6.base|) 80)), 4686#true, 4687#false] [2018-02-02 20:16:46,624 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-02 20:16:46,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:16:46,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:16:46,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:16:46,625 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 6 states. [2018-02-02 20:16:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:46,755 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-02 20:16:46,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:16:46,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 20:16:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:46,756 INFO L225 Difference]: With dead ends: 125 [2018-02-02 20:16:46,756 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 20:16:46,757 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:16:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 20:16:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-02-02 20:16:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 20:16:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-02 20:16:46,760 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 30 [2018-02-02 20:16:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:46,760 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-02 20:16:46,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:16:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-02 20:16:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:16:46,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:46,761 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] [2018-02-02 20:16:46,761 INFO L371 AbstractCegarLoop]: === Iteration 20 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:46,761 INFO L82 PathProgramCache]: Analyzing trace with hash 660985097, now seen corresponding path program 1 times [2018-02-02 20:16:46,762 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:46,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:46,863 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-02 20:16:46,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:46,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:16:46,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:46,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-02 20:16:46,865 INFO L182 omatonBuilderFactory]: Interpolants [4949#true, 4950#false, 4951#(= 1 (select |#valid| append_~pointerToList.base)), 4952#(= |#valid| |old(#valid)|), 4953#(= |#valid| (store |old(#valid)| |create_data_#t~malloc1.base| (select |#valid| |create_data_#t~malloc1.base|))), 4954#(and (or (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 4955#(and (or (and (= create_data_~data~0.base (@diff |old(#valid)| |#valid|)) (= 1 (select |#valid| create_data_~data~0.base))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 4956#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 20:16:46,865 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-02 20:16:46,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:16:46,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:16:46,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:16:46,865 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 8 states. [2018-02-02 20:16:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:47,109 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-02-02 20:16:47,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:16:47,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-02 20:16:47,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:47,111 INFO L225 Difference]: With dead ends: 134 [2018-02-02 20:16:47,111 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 20:16:47,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:16:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 20:16:47,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2018-02-02 20:16:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 20:16:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-02-02 20:16:47,115 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 31 [2018-02-02 20:16:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:47,115 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-02-02 20:16:47,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:16:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-02-02 20:16:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:16:47,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:47,116 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] [2018-02-02 20:16:47,116 INFO L371 AbstractCegarLoop]: === Iteration 21 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:47,116 INFO L82 PathProgramCache]: Analyzing trace with hash 660985098, now seen corresponding path program 1 times [2018-02-02 20:16:47,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:47,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:47,221 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-02 20:16:47,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:47,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:16:47,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:47,222 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-02 20:16:47,222 INFO L182 omatonBuilderFactory]: Interpolants [5232#(and (< 0 (+ append_~pointerToList.offset 1)) (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base))), 5223#true, 5224#false, 5225#(= 0 |main_~#list~0.offset|), 5226#(= 0 |append_#in~pointerToList.offset|), 5227#(= append_~pointerToList.offset 0), 5228#(and (< 0 (+ append_~pointerToList.offset 1)) (<= (+ append_~pointerToList.offset 4) (select |#length| append_~pointerToList.base)) (= (select |#valid| append_~pointerToList.base) 1)), 5229#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 5230#(and (= |#length| (store |old(#length)| |create_data_#t~malloc1.base| (select |#length| |create_data_#t~malloc1.base|))) (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|))), 5231#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))))] [2018-02-02 20:16:47,222 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-02 20:16:47,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:16:47,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:16:47,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:16:47,223 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 10 states. [2018-02-02 20:16:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:47,469 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-02-02 20:16:47,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:16:47,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-02 20:16:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:47,476 INFO L225 Difference]: With dead ends: 133 [2018-02-02 20:16:47,476 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 20:16:47,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:16:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 20:16:47,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2018-02-02 20:16:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 20:16:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-02-02 20:16:47,479 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 31 [2018-02-02 20:16:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:47,480 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-02-02 20:16:47,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:16:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-02-02 20:16:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:16:47,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:47,480 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:16:47,481 INFO L371 AbstractCegarLoop]: === Iteration 22 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:47,481 INFO L82 PathProgramCache]: Analyzing trace with hash -184722078, now seen corresponding path program 1 times [2018-02-02 20:16:47,481 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:47,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:47,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:16:47,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:16:47,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:47,599 INFO L182 omatonBuilderFactory]: Interpolants [5504#false, 5505#(= 0 |main_~#list~0.offset|), 5506#(and (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= |append_#in~pointerToList.offset| append_~pointerToList.offset) (= append_~pointerToList.offset 0))), 5507#(and (= (select |#valid| |append_#in~pointerToList.base|) 1) (or (<= 4 (select |#length| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.offset| 0)))), 5508#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (= (select |#valid| |main_~#list~0.base|) 1)), 5509#(and (<= 4 (select |#length| |append_#in~pointerToList.base|)) (= 0 |append_#in~pointerToList.offset|) (= (select |#valid| |append_#in~pointerToList.base|) 1)), 5510#(and (<= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0) (= (select |#valid| append_~pointerToList.base) 1)), 5511#(and (<= 4 (select |#length| append_~pointerToList.base)) (= append_~pointerToList.offset 0)), 5503#true] [2018-02-02 20:16:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:47,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:16:47,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:16:47,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:16:47,600 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 9 states. [2018-02-02 20:16:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:47,701 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 20:16:47,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:16:47,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-02 20:16:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:47,702 INFO L225 Difference]: With dead ends: 119 [2018-02-02 20:16:47,702 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 20:16:47,702 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:16:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 20:16:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2018-02-02 20:16:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 20:16:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-02-02 20:16:47,704 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 34 [2018-02-02 20:16:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:47,704 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-02-02 20:16:47,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:16:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-02-02 20:16:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:16:47,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:47,704 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] [2018-02-02 20:16:47,705 INFO L371 AbstractCegarLoop]: === Iteration 23 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash 501156800, now seen corresponding path program 1 times [2018-02-02 20:16:47,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:47,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:47,751 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-02 20:16:47,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:47,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:16:47,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:47,752 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-02 20:16:47,752 INFO L182 omatonBuilderFactory]: Interpolants [5744#true, 5745#false, 5746#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 5747#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 5748#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 5749#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 5750#(= 1 (select |#valid| |main_#t~mem21.base|))] [2018-02-02 20:16:47,752 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-02 20:16:47,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:16:47,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:16:47,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:16:47,753 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 7 states. [2018-02-02 20:16:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:47,878 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-02 20:16:47,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:16:47,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-02 20:16:47,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:47,879 INFO L225 Difference]: With dead ends: 130 [2018-02-02 20:16:47,879 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 20:16:47,879 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:16:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 20:16:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 114. [2018-02-02 20:16:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 20:16:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-02-02 20:16:47,881 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 33 [2018-02-02 20:16:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:47,881 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-02-02 20:16:47,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:16:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-02-02 20:16:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 20:16:47,882 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:47,882 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] [2018-02-02 20:16:47,882 INFO L371 AbstractCegarLoop]: === Iteration 24 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash 501156801, now seen corresponding path program 1 times [2018-02-02 20:16:47,882 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:47,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:47,954 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-02 20:16:47,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:47,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:16:47,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:47,954 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-02 20:16:47,954 INFO L182 omatonBuilderFactory]: Interpolants [6001#true, 6002#false, 6003#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 6004#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 6005#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 8 (select |#length| append_~node~0.base))), 6006#(= |old(#length)| |#length|), 6007#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 6008#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 6009#(and (= (select |#length| |main_#t~mem21.base|) 8) (= |main_#t~mem21.offset| 0))] [2018-02-02 20:16:47,955 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-02 20:16:47,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:16:47,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:16:47,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:16:47,955 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 9 states. [2018-02-02 20:16:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:48,176 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2018-02-02 20:16:48,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:16:48,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 20:16:48,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:48,177 INFO L225 Difference]: With dead ends: 153 [2018-02-02 20:16:48,177 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 20:16:48,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:16:48,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 20:16:48,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 128. [2018-02-02 20:16:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 20:16:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-02-02 20:16:48,181 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 33 [2018-02-02 20:16:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:48,182 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-02-02 20:16:48,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:16:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-02-02 20:16:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:16:48,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:48,183 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] [2018-02-02 20:16:48,183 INFO L371 AbstractCegarLoop]: === Iteration 25 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:48,183 INFO L82 PathProgramCache]: Analyzing trace with hash 574362333, now seen corresponding path program 1 times [2018-02-02 20:16:48,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:48,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:48,248 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-02 20:16:48,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:48,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:16:48,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:48,249 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-02 20:16:48,249 INFO L182 omatonBuilderFactory]: Interpolants [6305#true, 6306#false, 6307#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 6308#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|))), 6309#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 append_~node~0.base))), 6310#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 6311#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 6312#(not (= 0 |main_#t~mem27.base|))] [2018-02-02 20:16:48,249 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-02 20:16:48,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:16:48,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:16:48,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:16:48,250 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 8 states. [2018-02-02 20:16:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:48,372 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2018-02-02 20:16:48,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:16:48,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-02 20:16:48,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:48,372 INFO L225 Difference]: With dead ends: 151 [2018-02-02 20:16:48,372 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 20:16:48,373 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:16:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 20:16:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 128. [2018-02-02 20:16:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 20:16:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2018-02-02 20:16:48,375 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 35 [2018-02-02 20:16:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:48,375 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2018-02-02 20:16:48,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:16:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2018-02-02 20:16:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:16:48,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:48,376 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-02 20:16:48,376 INFO L371 AbstractCegarLoop]: === Iteration 26 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:48,376 INFO L82 PathProgramCache]: Analyzing trace with hash 655964540, now seen corresponding path program 1 times [2018-02-02 20:16:48,377 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:48,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:48,405 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-02 20:16:48,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:48,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:16:48,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:48,406 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-02 20:16:48,406 INFO L182 omatonBuilderFactory]: Interpolants [6602#true, 6603#false, 6604#(= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 6605#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 6606#(= 1 (select |#valid| |main_#t~mem23.base|))] [2018-02-02 20:16:48,406 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-02 20:16:48,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:16:48,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:16:48,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:48,407 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand 5 states. [2018-02-02 20:16:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:48,497 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-02-02 20:16:48,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:16:48,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-02-02 20:16:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:48,499 INFO L225 Difference]: With dead ends: 127 [2018-02-02 20:16:48,499 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 20:16:48,499 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:16:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 20:16:48,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-02 20:16:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 20:16:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2018-02-02 20:16:48,502 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 36 [2018-02-02 20:16:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:48,502 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2018-02-02 20:16:48,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:16:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2018-02-02 20:16:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:16:48,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:48,504 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-02 20:16:48,504 INFO L371 AbstractCegarLoop]: === Iteration 27 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:48,504 INFO L82 PathProgramCache]: Analyzing trace with hash 655964541, now seen corresponding path program 1 times [2018-02-02 20:16:48,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:48,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:48,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-02 20:16:48,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:48,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:16:48,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:48,670 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-02 20:16:48,670 INFO L182 omatonBuilderFactory]: Interpolants [6865#true, 6866#false, 6867#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 6868#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 6869#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 8 (select |#length| append_~node~0.base))), 6870#(= |old(#length)| |#length|), 6871#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 6872#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 6873#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.offset| 0)), 6874#(and (<= 0 |main_#t~mem23.offset|) (<= |main_#t~mem23.offset| 0) (= (select |#length| |main_#t~mem23.base|) 8))] [2018-02-02 20:16:48,670 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-02 20:16:48,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:16:48,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:16:48,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:16:48,671 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 10 states. [2018-02-02 20:16:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:48,964 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2018-02-02 20:16:48,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:16:48,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-02 20:16:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:48,965 INFO L225 Difference]: With dead ends: 147 [2018-02-02 20:16:48,965 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 20:16:48,965 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:16:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 20:16:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2018-02-02 20:16:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 20:16:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-02-02 20:16:48,969 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 36 [2018-02-02 20:16:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:48,969 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-02-02 20:16:48,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:16:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-02-02 20:16:48,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 20:16:48,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:48,969 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:16:48,970 INFO L371 AbstractCegarLoop]: === Iteration 28 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:48,970 INFO L82 PathProgramCache]: Analyzing trace with hash -747720392, now seen corresponding path program 1 times [2018-02-02 20:16:48,970 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:48,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:49,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:16:49,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:16:49,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:49,045 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-02 20:16:49,045 INFO L182 omatonBuilderFactory]: Interpolants [7168#(= (select |#valid| |create_data_#t~malloc1.base|) 1), 7169#(= (select |#valid| create_data_~data~0.base) 1), 7170#(and (= 1 (select |#valid| |create_data_#t~malloc3.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc3.base|))), 7171#(and (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 7172#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (not (= create_data_~data~0.base |create_data_#t~mem6.base|))), 7173#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 7174#(= 1 (select |#valid| |create_data_#t~mem6.base|)), 7166#true, 7167#false] [2018-02-02 20:16:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:49,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:16:49,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:16:49,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:16:49,046 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 9 states. [2018-02-02 20:16:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:49,266 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-02 20:16:49,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:16:49,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-02-02 20:16:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:49,267 INFO L225 Difference]: With dead ends: 129 [2018-02-02 20:16:49,267 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 20:16:49,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:16:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 20:16:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-02-02 20:16:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 20:16:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-02-02 20:16:49,270 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 37 [2018-02-02 20:16:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:49,270 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-02-02 20:16:49,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:16:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-02-02 20:16:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 20:16:49,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:49,271 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:16:49,271 INFO L371 AbstractCegarLoop]: === Iteration 29 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash -747720391, now seen corresponding path program 1 times [2018-02-02 20:16:49,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:49,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:49,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:16:49,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:16:49,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:49,480 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-02 20:16:49,480 INFO L182 omatonBuilderFactory]: Interpolants [7441#true, 7442#false, 7443#(= (select |#valid| |create_data_#t~malloc1.base|) 1), 7444#(= (select |#valid| create_data_~data~0.base) 1), 7445#(and (= 0 |create_data_#t~malloc3.offset|) (= 80 (select |#length| |create_data_#t~malloc3.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc3.base|))), 7446#(and (not (= create_data_~data~0.base (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 7447#(and (= |create_data_#t~mem6.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (not (= create_data_~data~0.base |create_data_#t~mem6.base|)) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 7448#(and (<= 0 create_data_~counter~0) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 7449#(and (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (<= 1 create_data_~counter~0) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 7450#(and (<= create_data_~counter~0 19) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (<= 1 create_data_~counter~0) (= 80 (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))))), 7451#(and (<= create_data_~counter~0 19) (= |create_data_#t~mem6.offset| 0) (= (select |#length| |create_data_#t~mem6.base|) 80) (<= 1 create_data_~counter~0))] [2018-02-02 20:16:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:49,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:16:49,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:16:49,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:16:49,480 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 11 states. [2018-02-02 20:16:49,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:49,714 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-02-02 20:16:49,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:16:49,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-02-02 20:16:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:49,715 INFO L225 Difference]: With dead ends: 130 [2018-02-02 20:16:49,715 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 20:16:49,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:16:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 20:16:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-02-02 20:16:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 20:16:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2018-02-02 20:16:49,717 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 37 [2018-02-02 20:16:49,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:49,717 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2018-02-02 20:16:49,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:16:49,717 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2018-02-02 20:16:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:16:49,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:49,717 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] [2018-02-02 20:16:49,717 INFO L371 AbstractCegarLoop]: === Iteration 30 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:49,717 INFO L82 PathProgramCache]: Analyzing trace with hash 484884458, now seen corresponding path program 1 times [2018-02-02 20:16:49,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:49,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:49,909 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-02 20:16:49,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:49,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 20:16:49,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:49,910 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-02 20:16:49,910 INFO L182 omatonBuilderFactory]: Interpolants [7723#true, 7724#false, 7725#(= (select |#valid| |main_~#list~0.base|) 1), 7726#(= |#valid| |old(#valid)|), 7727#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 7728#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 7729#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 7730#(and (= 0 |create_data_#res.base|) (= 0 |create_data_#res.offset|)), 7731#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~ret17.offset|) (= 0 |append_#t~ret17.base|))) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 7732#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) append_~node~0.offset))) (= append_~pointerToList.base append_~node~0.base)) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 7733#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 7734#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7735#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 7736#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 7737#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 7738#(and (= 0 |freeData_#in~data.offset|) (= 0 |freeData_#in~data.base|)), 7739#(and (= 0 freeData_~data.offset) (= freeData_~data.base 0))] [2018-02-02 20:16:49,910 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-02 20:16:49,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:16:49,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:16:49,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:16:49,911 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 17 states. [2018-02-02 20:16:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:50,512 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2018-02-02 20:16:50,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:16:50,512 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-02-02 20:16:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:50,513 INFO L225 Difference]: With dead ends: 164 [2018-02-02 20:16:50,513 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 20:16:50,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:16:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 20:16:50,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-02-02 20:16:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 20:16:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-02-02 20:16:50,517 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 40 [2018-02-02 20:16:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:50,517 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-02-02 20:16:50,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:16:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-02-02 20:16:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:16:50,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:50,518 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] [2018-02-02 20:16:50,518 INFO L371 AbstractCegarLoop]: === Iteration 31 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:50,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1287024166, now seen corresponding path program 1 times [2018-02-02 20:16:50,519 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:50,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:50,662 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-02 20:16:50,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:50,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:16:50,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:50,663 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-02 20:16:50,663 INFO L182 omatonBuilderFactory]: Interpolants [8084#true, 8085#false, 8086#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 8087#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 8088#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 8 (select |#length| append_~node~0.base))), 8089#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= (select |#valid| append_~node~0.base) 1) (= 8 (select |#length| append_~node~0.base))), 8090#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 8091#(and (= |#length| (store |old(#length)| |create_data_#t~malloc1.base| (select |#length| |create_data_#t~malloc1.base|))) (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|))), 8092#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 8093#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 8094#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 8095#(and (= 8 (select |#length| |main_#t~mem21.base|)) (= |main_#t~mem21.offset| 0))] [2018-02-02 20:16:50,663 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-02 20:16:50,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:16:50,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:16:50,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:16:50,664 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 12 states. [2018-02-02 20:16:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:51,074 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2018-02-02 20:16:51,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:16:51,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-02 20:16:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:51,076 INFO L225 Difference]: With dead ends: 181 [2018-02-02 20:16:51,076 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 20:16:51,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:16:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 20:16:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 155. [2018-02-02 20:16:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 20:16:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2018-02-02 20:16:51,080 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 40 [2018-02-02 20:16:51,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:51,081 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2018-02-02 20:16:51,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:16:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2018-02-02 20:16:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:16:51,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:51,081 INFO L351 BasicCegarLoop]: trace histogram [2, 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-02 20:16:51,081 INFO L371 AbstractCegarLoop]: === Iteration 32 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:51,081 INFO L82 PathProgramCache]: Analyzing trace with hash 268633466, now seen corresponding path program 1 times [2018-02-02 20:16:51,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:51,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:16:51,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:16:51,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 20:16:51,137 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:16:51,138 INFO L182 omatonBuilderFactory]: Interpolants [8454#true, 8455#false, 8456#(= create_data_~counter~0 0), 8457#(<= create_data_~counter~0 1)] [2018-02-02 20:16:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:16:51,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:16:51,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:16:51,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:16:51,138 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand 4 states. [2018-02-02 20:16:51,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:51,151 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2018-02-02 20:16:51,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:16:51,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-02-02 20:16:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:51,153 INFO L225 Difference]: With dead ends: 167 [2018-02-02 20:16:51,153 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 20:16:51,153 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:16:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 20:16:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2018-02-02 20:16:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 20:16:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2018-02-02 20:16:51,158 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 60 [2018-02-02 20:16:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:51,158 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2018-02-02 20:16:51,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:16:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2018-02-02 20:16:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:16:51,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:51,159 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, 1, 1, 1] [2018-02-02 20:16:51,159 INFO L371 AbstractCegarLoop]: === Iteration 33 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash -907645030, now seen corresponding path program 1 times [2018-02-02 20:16:51,160 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:51,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:51,297 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-02 20:16:51,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:51,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:16:51,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:51,297 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-02 20:16:51,297 INFO L182 omatonBuilderFactory]: Interpolants [8787#true, 8788#false, 8789#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 8790#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 8791#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 8792#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 8793#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 8794#(= 0 |main_#t~mem25.offset|)] [2018-02-02 20:16:51,297 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-02 20:16:51,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:16:51,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:16:51,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:16:51,298 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand 8 states. [2018-02-02 20:16:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:51,397 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2018-02-02 20:16:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:16:51,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-02-02 20:16:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:51,398 INFO L225 Difference]: With dead ends: 178 [2018-02-02 20:16:51,398 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 20:16:51,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:16:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 20:16:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2018-02-02 20:16:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 20:16:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 189 transitions. [2018-02-02 20:16:51,401 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 189 transitions. Word has length 44 [2018-02-02 20:16:51,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:51,401 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 189 transitions. [2018-02-02 20:16:51,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:16:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 189 transitions. [2018-02-02 20:16:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:16:51,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:51,402 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, 1, 1, 1] [2018-02-02 20:16:51,402 INFO L371 AbstractCegarLoop]: === Iteration 34 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash -907645029, now seen corresponding path program 1 times [2018-02-02 20:16:51,403 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:51,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:51,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-02 20:16:51,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:51,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:16:51,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:51,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-02 20:16:51,497 INFO L182 omatonBuilderFactory]: Interpolants [9154#true, 9155#false, 9156#(= |main_#t~mem23.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 9157#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 9158#(= |#valid| |old(#valid)|), 9159#(= 1 (select |#valid| |main_#t~mem25.base|))] [2018-02-02 20:16:51,497 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-02 20:16:51,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:16:51,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:16:51,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:16:51,497 INFO L87 Difference]: Start difference. First operand 171 states and 189 transitions. Second operand 6 states. [2018-02-02 20:16:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:51,576 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2018-02-02 20:16:51,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:16:51,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-02 20:16:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:51,577 INFO L225 Difference]: With dead ends: 177 [2018-02-02 20:16:51,577 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 20:16:51,578 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:16:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 20:16:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-02-02 20:16:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 20:16:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2018-02-02 20:16:51,582 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 44 [2018-02-02 20:16:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:51,582 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2018-02-02 20:16:51,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:16:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2018-02-02 20:16:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:16:51,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:51,583 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, 1, 1] [2018-02-02 20:16:51,583 INFO L371 AbstractCegarLoop]: === Iteration 35 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:51,583 INFO L82 PathProgramCache]: Analyzing trace with hash 563904760, now seen corresponding path program 1 times [2018-02-02 20:16:51,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:51,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:51,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-02 20:16:51,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:51,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:16:51,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:51,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-02 20:16:51,736 INFO L182 omatonBuilderFactory]: Interpolants [9520#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 9521#(and (= |main_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.offset| 0)), 9522#(and (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9523#(and (<= 0 |main_#t~mem23.offset|) (<= (+ |main_#t~mem23.offset| 8) (select |#length| |main_#t~mem23.base|))), 9514#true, 9515#false, 9516#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 9517#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 9518#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 9519#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))] [2018-02-02 20:16:51,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-02 20:16:51,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:16:51,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:16:51,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:16:51,737 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand 10 states. [2018-02-02 20:16:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:51,873 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2018-02-02 20:16:51,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:16:51,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-02-02 20:16:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:51,874 INFO L225 Difference]: With dead ends: 179 [2018-02-02 20:16:51,874 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 20:16:51,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:16:51,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 20:16:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2018-02-02 20:16:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 20:16:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 180 transitions. [2018-02-02 20:16:51,877 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 180 transitions. Word has length 43 [2018-02-02 20:16:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:51,877 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 180 transitions. [2018-02-02 20:16:51,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:16:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2018-02-02 20:16:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:16:51,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:51,878 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, 1, 1, 1, 1, 1] [2018-02-02 20:16:51,878 INFO L371 AbstractCegarLoop]: === Iteration 36 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:51,878 INFO L82 PathProgramCache]: Analyzing trace with hash -368510437, now seen corresponding path program 1 times [2018-02-02 20:16:51,878 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:51,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:51,958 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-02 20:16:51,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:51,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:16:51,959 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:51,959 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-02 20:16:51,959 INFO L182 omatonBuilderFactory]: Interpolants [9888#(not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 9889#(and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9890#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9891#(and (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0))) (not (= |main_~#list~0.base| |main_#t~mem25.base|)) (= 1 (select |#valid| |main_~#list~0.base|))), 9880#true, 9881#false, 9882#(= 1 (select |#valid| |main_~#list~0.base|)), 9883#(= |#valid| |old(#valid)|), 9884#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 9885#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 9886#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base))), 9887#(= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))] [2018-02-02 20:16:51,960 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-02 20:16:51,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:16:51,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:16:51,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:16:51,960 INFO L87 Difference]: Start difference. First operand 163 states and 180 transitions. Second operand 12 states. [2018-02-02 20:16:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:52,143 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2018-02-02 20:16:52,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:16:52,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-02-02 20:16:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:52,144 INFO L225 Difference]: With dead ends: 197 [2018-02-02 20:16:52,144 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 20:16:52,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:16:52,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 20:16:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2018-02-02 20:16:52,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-02-02 20:16:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2018-02-02 20:16:52,148 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 46 [2018-02-02 20:16:52,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:52,148 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2018-02-02 20:16:52,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:16:52,149 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2018-02-02 20:16:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:16:52,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:52,149 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:16:52,149 INFO L371 AbstractCegarLoop]: === Iteration 37 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:52,149 INFO L82 PathProgramCache]: Analyzing trace with hash 221499877, now seen corresponding path program 1 times [2018-02-02 20:16:52,150 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:52,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:52,384 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-02 20:16:52,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:52,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 20:16:52,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:52,384 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-02 20:16:52,385 INFO L182 omatonBuilderFactory]: Interpolants [10304#(= 1 (select |#valid| |freeData_#in~data.base|)), 10305#(= 1 (select |#valid| freeData_~data.base)), 10288#true, 10289#false, 10290#(= (select |#valid| |main_~#list~0.base|) 1), 10291#(= |#valid| |old(#valid)|), 10292#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 10293#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 10294#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 10295#(= 1 (select |#valid| create_data_~data~0.base)), 10296#(= 1 (select |#valid| |create_data_#res.base|)), 10297#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| |append_#t~ret17.base|))))), 10298#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)))) (= append_~node~0.base append_~pointerToList.base))), 10299#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 10300#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10301#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 10302#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 10303#(= 1 (select |#valid| |main_#t~mem24.base|))] [2018-02-02 20:16:52,385 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-02 20:16:52,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:16:52,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:16:52,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:16:52,386 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand 18 states. [2018-02-02 20:16:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:53,025 INFO L93 Difference]: Finished difference Result 215 states and 242 transitions. [2018-02-02 20:16:53,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:16:53,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-02-02 20:16:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:53,026 INFO L225 Difference]: With dead ends: 215 [2018-02-02 20:16:53,026 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 20:16:53,026 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:16:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 20:16:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 194. [2018-02-02 20:16:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:16:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2018-02-02 20:16:53,030 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 47 [2018-02-02 20:16:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:53,030 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2018-02-02 20:16:53,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:16:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-02-02 20:16:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:16:53,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:53,030 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, 1, 1, 1, 1, 1, 1] [2018-02-02 20:16:53,030 INFO L371 AbstractCegarLoop]: === Iteration 38 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:53,030 INFO L82 PathProgramCache]: Analyzing trace with hash 221499878, now seen corresponding path program 1 times [2018-02-02 20:16:53,031 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:53,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:53,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-02 20:16:53,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:53,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 20:16:53,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:53,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-02 20:16:53,277 INFO L182 omatonBuilderFactory]: Interpolants [10752#(= |#valid| |old(#valid)|), 10753#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 10754#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 10755#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 10756#(and (= 8 (select |#length| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 10757#(and (= 0 create_data_~data~0.offset) (= 8 (select |#length| create_data_~data~0.base))), 10758#(and (= 0 |create_data_#res.offset|) (= 8 (select |#length| |create_data_#res.base|))), 10759#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 8 (select |#length| |append_#t~ret17.base|)) (= 0 |append_#t~ret17.offset|)) (= append_~node~0.base append_~pointerToList.base))), 10760#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) append_~node~0.offset))) (= append_~node~0.base append_~pointerToList.base))), 10761#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 10762#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10763#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 10764#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)))), 10765#(and (= 8 (select |#length| |main_#t~mem24.base|)) (= 0 |main_#t~mem24.offset|)), 10766#(and (= 0 |freeData_#in~data.offset|) (= 8 (select |#length| |freeData_#in~data.base|))), 10767#(and (= (select |#length| freeData_~data.base) 8) (= 0 freeData_~data.offset)), 10749#true, 10750#false, 10751#(= (select |#valid| |main_~#list~0.base|) 1)] [2018-02-02 20:16:53,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-02 20:16:53,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:16:53,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:16:53,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:16:53,278 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand 19 states. [2018-02-02 20:16:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:54,037 INFO L93 Difference]: Finished difference Result 232 states and 262 transitions. [2018-02-02 20:16:54,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:16:54,069 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-02-02 20:16:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:54,070 INFO L225 Difference]: With dead ends: 232 [2018-02-02 20:16:54,070 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 20:16:54,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:16:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 20:16:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 211. [2018-02-02 20:16:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 20:16:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 242 transitions. [2018-02-02 20:16:54,074 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 242 transitions. Word has length 47 [2018-02-02 20:16:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:54,075 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 242 transitions. [2018-02-02 20:16:54,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:16:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 242 transitions. [2018-02-02 20:16:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:16:54,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:54,076 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:16:54,077 INFO L371 AbstractCegarLoop]: === Iteration 39 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1594265010, now seen corresponding path program 1 times [2018-02-02 20:16:54,077 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:54,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:54,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:16:54,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:16:54,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:54,109 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-02 20:16:54,109 INFO L182 omatonBuilderFactory]: Interpolants [11249#true, 11250#false, 11251#(= create_data_~counter~0 0), 11252#(<= create_data_~counter~0 1), 11253#(<= create_data_~counter~0 2)] [2018-02-02 20:16:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:54,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:16:54,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:16:54,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:54,110 INFO L87 Difference]: Start difference. First operand 211 states and 242 transitions. Second operand 5 states. [2018-02-02 20:16:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:54,128 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2018-02-02 20:16:54,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:16:54,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-02 20:16:54,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:54,129 INFO L225 Difference]: With dead ends: 223 [2018-02-02 20:16:54,129 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 20:16:54,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:16:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 20:16:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 218. [2018-02-02 20:16:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 20:16:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 249 transitions. [2018-02-02 20:16:54,134 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 249 transitions. Word has length 47 [2018-02-02 20:16:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:54,134 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 249 transitions. [2018-02-02 20:16:54,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:16:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 249 transitions. [2018-02-02 20:16:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:16:54,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:54,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:16:54,135 INFO L371 AbstractCegarLoop]: === Iteration 40 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1633162428, now seen corresponding path program 1 times [2018-02-02 20:16:54,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:54,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:54,585 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-02 20:16:54,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:54,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 20:16:54,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:54,586 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-02 20:16:54,586 INFO L182 omatonBuilderFactory]: Interpolants [11712#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 11713#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4))), 11714#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem24.base|) 4)) (= 0 |main_#t~mem24.offset|)), 11715#(and (= 0 |freeData_#in~data.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |freeData_#in~data.base|) 4))), 11716#(and (= 0 freeData_~data.offset) (= 0 (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4)))), 11717#(= |freeData_#t~mem13.offset| 0), 11695#true, 11696#false, 11697#(= (select |#valid| |main_~#list~0.base|) 1), 11698#(= |#valid| |old(#valid)|), 11699#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 11700#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 11701#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 11702#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~pointerToList.base) 1))) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 11703#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~pointerToList.base) 1) (= (select |#valid| append_~node~0.base) 1)) (= append_~node~0.base append_~pointerToList.base)) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 11704#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 11705#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 11706#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (+ create_data_~data~0.offset 4)))), 11707#(and (= 0 (select |old(#valid)| |create_data_#res.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |create_data_#res.base|) 4)) (= 0 |create_data_#res.offset|)), 11708#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~node~0.base (store (select |#memory_$Pointer$.offset| append_~node~0.base) append_~node~0.offset |append_#t~ret17.offset|)) |append_#t~ret17.base|) 4)) (= 0 |append_#t~ret17.offset|) (not (= append_~pointerToList.base |append_#t~ret17.base|))) (= append_~node~0.base append_~pointerToList.base)) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 11709#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) append_~node~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) 4)))) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 11710#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 11711#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)))] [2018-02-02 20:16:54,586 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-02 20:16:54,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:16:54,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:16:54,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:16:54,587 INFO L87 Difference]: Start difference. First operand 218 states and 249 transitions. Second operand 23 states. [2018-02-02 20:16:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:55,620 INFO L93 Difference]: Finished difference Result 274 states and 311 transitions. [2018-02-02 20:16:55,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:16:55,621 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-02-02 20:16:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:55,621 INFO L225 Difference]: With dead ends: 274 [2018-02-02 20:16:55,622 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 20:16:55,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=2043, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:16:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 20:16:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 242. [2018-02-02 20:16:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 20:16:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 280 transitions. [2018-02-02 20:16:55,625 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 280 transitions. Word has length 50 [2018-02-02 20:16:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:55,626 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 280 transitions. [2018-02-02 20:16:55,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:16:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 280 transitions. [2018-02-02 20:16:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:16:55,626 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:55,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:16:55,626 INFO L371 AbstractCegarLoop]: === Iteration 41 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:55,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1633162429, now seen corresponding path program 1 times [2018-02-02 20:16:55,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:55,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:56,092 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-02 20:16:56,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:56,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 20:16:56,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:56,093 INFO L182 omatonBuilderFactory]: Interpolants [12288#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 12289#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 12290#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 12291#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~pointerToList.base) 1)))), 12292#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~pointerToList.base) 1) (= (select |#valid| append_~node~0.base) 1)) (= append_~node~0.base append_~pointerToList.base))), 12293#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 12294#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 12295#(and (= 0 create_data_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base))), 12296#(and (= 0 (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)) (= 0 (select |old(#valid)| |create_data_#res.base|)) (= 0 |create_data_#res.offset|)), 12297#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|)) |append_#t~ret17.base|) 4)) (= 0 |append_#t~ret17.offset|) (not (= append_~pointerToList.base |append_#t~ret17.base|)))) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 12298#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) append_~node~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) 4))) (= append_~node~0.base append_~pointerToList.base))), 12299#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 12300#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 12301#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 12302#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4))), 12303#(and (= 0 |main_#t~mem24.offset|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) 4))), 12304#(and (= 0 |freeData_#in~data.offset|) (= 0 (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4))), 12305#(and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 0 freeData_~data.offset)), 12306#(= |freeData_#t~mem13.base| 0), 12284#true, 12285#false, 12286#(= (select |#valid| |main_~#list~0.base|) 1), 12287#(= |#valid| |old(#valid)|)] [2018-02-02 20:16:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:56,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:16:56,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:16:56,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:16:56,094 INFO L87 Difference]: Start difference. First operand 242 states and 280 transitions. Second operand 23 states. [2018-02-02 20:16:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:57,155 INFO L93 Difference]: Finished difference Result 273 states and 309 transitions. [2018-02-02 20:16:57,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:16:57,155 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-02-02 20:16:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:57,156 INFO L225 Difference]: With dead ends: 273 [2018-02-02 20:16:57,156 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 20:16:57,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:16:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 20:16:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 242. [2018-02-02 20:16:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 20:16:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 278 transitions. [2018-02-02 20:16:57,160 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 278 transitions. Word has length 50 [2018-02-02 20:16:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:57,160 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 278 transitions. [2018-02-02 20:16:57,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:16:57,160 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2018-02-02 20:16:57,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:16:57,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:57,160 INFO L351 BasicCegarLoop]: trace histogram [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-02 20:16:57,160 INFO L371 AbstractCegarLoop]: === Iteration 42 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:57,161 INFO L82 PathProgramCache]: Analyzing trace with hash -420728712, now seen corresponding path program 1 times [2018-02-02 20:16:57,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:57,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:57,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:16:57,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:16:57,573 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:57,573 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-02 20:16:57,573 INFO L182 omatonBuilderFactory]: Interpolants [12870#true, 12871#false, 12872#(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|))), 12873#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12874#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12875#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12876#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base)))), 12877#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base)))), 12878#(and (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))))), 12879#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (and (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 12880#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 12881#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 12882#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 12883#(or (and (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= |main_#t~mem21.offset| 0)) (or (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (not (= |main_#t~mem21.offset| 0)))) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 12884#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 |main_#t~mem22.base|) (= 0 |main_#t~mem22.offset|)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 12885#(or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 12886#(or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (not (= |main_#t~mem25.offset| 0)) (and (not (= |main_#t~mem25.base| 0)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 12887#(or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 12888#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.base| 0))] [2018-02-02 20:16:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:16:57,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:16:57,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:16:57,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:16:57,574 INFO L87 Difference]: Start difference. First operand 242 states and 278 transitions. Second operand 19 states. [2018-02-02 20:16:58,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:16:58,295 INFO L93 Difference]: Finished difference Result 257 states and 295 transitions. [2018-02-02 20:16:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:16:58,295 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-02 20:16:58,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:16:58,296 INFO L225 Difference]: With dead ends: 257 [2018-02-02 20:16:58,296 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 20:16:58,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:16:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 20:16:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 250. [2018-02-02 20:16:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 20:16:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 286 transitions. [2018-02-02 20:16:58,301 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 286 transitions. Word has length 51 [2018-02-02 20:16:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:16:58,301 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 286 transitions. [2018-02-02 20:16:58,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:16:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 286 transitions. [2018-02-02 20:16:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 20:16:58,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:16:58,302 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:16:58,302 INFO L371 AbstractCegarLoop]: === Iteration 43 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:16:58,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1806033505, now seen corresponding path program 1 times [2018-02-02 20:16:58,303 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:16:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:16:58,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:16:58,885 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-02 20:16:58,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:16:58,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-02 20:16:58,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:16:58,886 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-02 20:16:58,886 INFO L182 omatonBuilderFactory]: Interpolants [13440#(and (= 0 |freeData_#in~data.offset|) (= 0 (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4))), 13441#(and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 0 freeData_~data.offset)), 13442#(or (and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 0 freeData_~data.offset)) (= freeData_~data.base 0)), 13443#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 0 freeData_~data.offset)) (= freeData_~data.base 0)) (= |freeData_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4))) (= |freeData_#t~mem12.base| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 1 (select |#valid| freeData_~data.base))), 13444#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (= 0 freeData_~data.offset)) (= freeData_~data.base 0)) (= 1 (select |#valid| freeData_~data.base)) (or (not (= (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))))), 13445#(and (or (not (= 0 |freeData_#t~mem13.base|)) (not (= |freeData_#t~mem13.offset| 0))) (or (not (= freeData_~data.base |freeData_#t~mem13.base|)) (= freeData_~data.base 0)) (or (= freeData_~data.base |freeData_#t~mem13.base|) (= 1 (select |#valid| freeData_~data.base)))), 13446#(or (= 1 (select |#valid| freeData_~data.base)) (= freeData_~data.base 0)), 13420#true, 13421#false, 13422#(= 1 (select |#valid| |main_~#list~0.base|)), 13423#(= |#valid| |old(#valid)|), 13424#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 13425#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 13426#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 13427#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~pointerToList.base))))), 13428#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~pointerToList.base)) (= 1 (select |#valid| append_~node~0.base))))), 13429#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 13430#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 13431#(and (= 0 create_data_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base))), 13432#(and (= 0 (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)) (= 0 (select |old(#valid)| |create_data_#res.base|)) (= 0 |create_data_#res.offset|)), 13433#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|)) |append_#t~ret17.base|) 4)) (= 0 |append_#t~ret17.offset|) (not (= append_~pointerToList.base |append_#t~ret17.base|)))) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 13434#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) append_~node~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) 4))) (= append_~node~0.base append_~pointerToList.base))), 13435#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 13436#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 13437#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 13438#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4))), 13439#(and (= 0 |main_#t~mem24.offset|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) 4)))] [2018-02-02 20:16:58,886 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-02 20:16:58,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:16:58,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:16:58,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:16:58,887 INFO L87 Difference]: Start difference. First operand 250 states and 286 transitions. Second operand 27 states. [2018-02-02 20:17:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:00,060 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-02-02 20:17:00,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 20:17:00,060 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-02-02 20:17:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:00,061 INFO L225 Difference]: With dead ends: 280 [2018-02-02 20:17:00,061 INFO L226 Difference]: Without dead ends: 280 [2018-02-02 20:17:00,062 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=300, Invalid=3006, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:17:00,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-02 20:17:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 248. [2018-02-02 20:17:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 20:17:00,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 282 transitions. [2018-02-02 20:17:00,066 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 282 transitions. Word has length 52 [2018-02-02 20:17:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:00,066 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 282 transitions. [2018-02-02 20:17:00,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:17:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 282 transitions. [2018-02-02 20:17:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:17:00,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:00,067 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:17:00,067 INFO L371 AbstractCegarLoop]: === Iteration 44 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash -594351723, now seen corresponding path program 1 times [2018-02-02 20:17:00,067 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:00,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:00,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:00,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:17:00,346 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:00,346 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-02 20:17:00,346 INFO L182 omatonBuilderFactory]: Interpolants [14048#(and (or (and (= (store (store |#valid| |main_~#list~0.base| 0) |main_#t~mem25.base| (select (store |#valid| |main_#t~mem25.base| 0) |main_#t~mem25.base|)) |old(#valid)|) (not (= |main_#t~mem25.base| |main_~#list~0.base|))) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0)))), 14049#(or (= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 14037#true, 14038#false, 14039#(= |#valid| |old(#valid)|), 14040#(= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|), 14041#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 14042#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|)) (= |old(#valid)| (store |#valid| |append_#t~malloc14.base| (select |old(#valid)| |append_#t~malloc14.base|)))), 14043#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= (store |#valid| append_~node~0.base (select |old(#valid)| append_~node~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| append_~node~0.base)) (= |append_#in~pointerToList.base| append_~pointerToList.base)))), 14044#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= (store |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) |old(#valid)|))), 14045#(or (= (store (store |#valid| |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 14046#(and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= (store (store |#valid| |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 14047#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (store (store |#valid| |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))] [2018-02-02 20:17:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:00,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:17:00,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:17:00,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:17:00,347 INFO L87 Difference]: Start difference. First operand 248 states and 282 transitions. Second operand 13 states. [2018-02-02 20:17:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:00,709 INFO L93 Difference]: Finished difference Result 257 states and 292 transitions. [2018-02-02 20:17:00,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:17:00,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-02 20:17:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:00,710 INFO L225 Difference]: With dead ends: 257 [2018-02-02 20:17:00,710 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 20:17:00,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:17:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 20:17:00,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 227. [2018-02-02 20:17:00,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-02-02 20:17:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 260 transitions. [2018-02-02 20:17:00,715 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 260 transitions. Word has length 53 [2018-02-02 20:17:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:00,715 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 260 transitions. [2018-02-02 20:17:00,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:17:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 260 transitions. [2018-02-02 20:17:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 20:17:00,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:00,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:17:00,716 INFO L371 AbstractCegarLoop]: === Iteration 45 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash 419691716, now seen corresponding path program 1 times [2018-02-02 20:17:00,717 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:00,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:01,030 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-02 20:17:01,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:17:01,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-02 20:17:01,031 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:01,031 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-02 20:17:01,031 INFO L182 omatonBuilderFactory]: Interpolants [14560#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 1 (select |#valid| |main_~#list~0.base|))), 14561#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (= 1 (select |#valid| |main_~#list~0.base|))), 14562#(and (not (= |main_~#list~0.base| |main_#t~mem24.base|)) (= 1 (select |#valid| |main_~#list~0.base|))), 14563#(and (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 14564#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 14565#(and (or (= |#valid| |old(#valid)|) (and (= (select |#valid| (@diff |old(#valid)| |#valid|)) 0) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 14546#true, 14547#false, 14548#(= 1 (select |#valid| |main_~#list~0.base|)), 14549#(= |#valid| |old(#valid)|), 14550#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 14551#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 14552#(and (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 14553#(and (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~pointerToList.base))))), 14554#(= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)), 14555#(= 0 (select |old(#valid)| create_data_~data~0.base)), 14556#(= 0 (select |old(#valid)| |create_data_#res.base|)), 14557#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~pointerToList.base |append_#t~ret17.base|)))) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 14558#(and (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~pointerToList.base (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)))))), 14559#(and (= 1 (select |#valid| |append_#in~pointerToList.base|)) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))))] [2018-02-02 20:17:01,031 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-02 20:17:01,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:17:01,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:17:01,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:17:01,032 INFO L87 Difference]: Start difference. First operand 227 states and 260 transitions. Second operand 20 states. [2018-02-02 20:17:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:01,794 INFO L93 Difference]: Finished difference Result 258 states and 298 transitions. [2018-02-02 20:17:01,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:17:01,794 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-02-02 20:17:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:01,795 INFO L225 Difference]: With dead ends: 258 [2018-02-02 20:17:01,795 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 20:17:01,796 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:17:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 20:17:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 243. [2018-02-02 20:17:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 20:17:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 281 transitions. [2018-02-02 20:17:01,800 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 281 transitions. Word has length 53 [2018-02-02 20:17:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:01,800 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 281 transitions. [2018-02-02 20:17:01,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:17:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 281 transitions. [2018-02-02 20:17:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:17:01,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:01,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:17:01,801 INFO L371 AbstractCegarLoop]: === Iteration 46 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash 125541378, now seen corresponding path program 1 times [2018-02-02 20:17:01,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:01,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:02,163 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-02 20:17:02,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:17:02,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 20:17:02,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:02,164 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-02 20:17:02,164 INFO L182 omatonBuilderFactory]: Interpolants [15104#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (= 1 (select |#valid| append_~node~0.base)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)))) (= append_~node~0.base append_~pointerToList.base))), 15105#(and (or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 15106#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 15107#(and (or (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 15108#(and (or (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem24.base|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 15109#(and (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 15110#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| freeData_~data.base)), 15111#(and (or (= |#valid| |old(#valid)|) (and (= (select |#valid| (@diff |old(#valid)| |#valid|)) 0) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 15112#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 15113#(= 1 (select |#valid| |main_#t~mem25.base|)), 15095#true, 15096#false, 15097#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 15098#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))))), 15099#(= |#valid| |old(#valid)|), 15100#(= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)), 15101#(= 0 (select |old(#valid)| create_data_~data~0.base)), 15102#(= 0 (select |old(#valid)| |create_data_#res.base|)), 15103#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~node~0.base |append_#t~ret17.base|)))))] [2018-02-02 20:17:02,164 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-02 20:17:02,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:17:02,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:17:02,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:17:02,165 INFO L87 Difference]: Start difference. First operand 243 states and 281 transitions. Second operand 19 states. [2018-02-02 20:17:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:02,633 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2018-02-02 20:17:02,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:17:02,633 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-02-02 20:17:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:02,634 INFO L225 Difference]: With dead ends: 257 [2018-02-02 20:17:02,634 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 20:17:02,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:17:02,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 20:17:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 235. [2018-02-02 20:17:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-02 20:17:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 273 transitions. [2018-02-02 20:17:02,637 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 273 transitions. Word has length 54 [2018-02-02 20:17:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:02,637 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 273 transitions. [2018-02-02 20:17:02,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:17:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 273 transitions. [2018-02-02 20:17:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:17:02,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:02,638 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:17:02,638 INFO L371 AbstractCegarLoop]: === Iteration 47 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash 866020445, now seen corresponding path program 1 times [2018-02-02 20:17:02,639 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:02,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:17:03,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:03,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:17:03,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:17:03,014 INFO L182 omatonBuilderFactory]: Interpolants [15648#(= 1 (select |#valid| |freeData_#in~data.base|)), 15649#(= 1 (select |#valid| freeData_~data.base)), 15630#true, 15631#false, 15632#(= append_~pointerToList.base |append_#in~pointerToList.base|), 15633#(= (select |#valid| |append_#in~pointerToList.base|) 1), 15634#(= (select |#valid| |main_~#list~0.base|) 1), 15635#(= |#valid| |old(#valid)|), 15636#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 15637#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 15638#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 15639#(= 1 (select |#valid| create_data_~data~0.base)), 15640#(= 1 (select |#valid| |create_data_#res.base|)), 15641#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (= 1 (select |#valid| |append_#t~ret17.base|))), 15642#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)))) (= append_~node~0.base append_~pointerToList.base))), 15643#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 15644#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 15645#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 15646#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 15647#(= 1 (select |#valid| |main_#t~mem24.base|))] [2018-02-02 20:17:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:17:03,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:17:03,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:17:03,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:17:03,014 INFO L87 Difference]: Start difference. First operand 235 states and 273 transitions. Second operand 20 states. [2018-02-02 20:17:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:03,707 INFO L93 Difference]: Finished difference Result 270 states and 309 transitions. [2018-02-02 20:17:03,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:17:03,707 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2018-02-02 20:17:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:03,708 INFO L225 Difference]: With dead ends: 270 [2018-02-02 20:17:03,708 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 20:17:03,709 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=1383, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:17:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 20:17:03,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 239. [2018-02-02 20:17:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 20:17:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 276 transitions. [2018-02-02 20:17:03,713 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 276 transitions. Word has length 67 [2018-02-02 20:17:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:03,713 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 276 transitions. [2018-02-02 20:17:03,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:17:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 276 transitions. [2018-02-02 20:17:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:17:03,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:03,714 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:17:03,714 INFO L371 AbstractCegarLoop]: === Iteration 48 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:03,714 INFO L82 PathProgramCache]: Analyzing trace with hash -688882574, now seen corresponding path program 1 times [2018-02-02 20:17:03,715 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:03,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:17:04,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:04,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:17:04,042 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:17:04,043 INFO L182 omatonBuilderFactory]: Interpolants [16201#true, 16202#false, 16203#(= append_~pointerToList.base |append_#in~pointerToList.base|), 16204#(= (select |#valid| |append_#in~pointerToList.base|) 1), 16205#(= (select |#valid| |main_~#list~0.base|) 1), 16206#(= |#valid| |old(#valid)|), 16207#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 16208#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 16209#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|))) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 16210#(and (= 0 |create_data_#res.base|) (= 0 |create_data_#res.offset|)), 16211#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~ret17.offset|) (= 0 |append_#t~ret17.base|))) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 16212#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) append_~node~0.offset))) (= append_~pointerToList.base append_~node~0.base)) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 16213#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 16214#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 16215#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 16216#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 16217#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 16218#(and (= 0 |freeData_#in~data.offset|) (= 0 |freeData_#in~data.base|)), 16219#(and (= 0 freeData_~data.offset) (= freeData_~data.base 0))] [2018-02-02 20:17:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:17:04,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:17:04,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:17:04,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:17:04,043 INFO L87 Difference]: Start difference. First operand 239 states and 276 transitions. Second operand 19 states. [2018-02-02 20:17:04,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:04,678 INFO L93 Difference]: Finished difference Result 265 states and 301 transitions. [2018-02-02 20:17:04,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:17:04,678 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 20:17:04,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:04,679 INFO L225 Difference]: With dead ends: 265 [2018-02-02 20:17:04,679 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 20:17:04,680 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=1363, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:17:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 20:17:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 243. [2018-02-02 20:17:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 20:17:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 277 transitions. [2018-02-02 20:17:04,682 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 277 transitions. Word has length 60 [2018-02-02 20:17:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:04,683 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 277 transitions. [2018-02-02 20:17:04,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:17:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 277 transitions. [2018-02-02 20:17:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:17:04,683 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:04,683 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:17:04,684 INFO L371 AbstractCegarLoop]: === Iteration 49 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash 866020446, now seen corresponding path program 1 times [2018-02-02 20:17:04,684 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:04,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:17:05,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:05,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:17:05,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:17:05,154 INFO L182 omatonBuilderFactory]: Interpolants [16771#true, 16772#false, 16773#(= append_~pointerToList.base |append_#in~pointerToList.base|), 16774#(= (select |#valid| |append_#in~pointerToList.base|) 1), 16775#(= (select |#valid| |main_~#list~0.base|) 1), 16776#(= |#valid| |old(#valid)|), 16777#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 16778#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 16779#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 16780#(and (= 8 (select |#length| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 16781#(and (= 0 create_data_~data~0.offset) (= 8 (select |#length| create_data_~data~0.base))), 16782#(and (= 0 |create_data_#res.offset|) (= 8 (select |#length| |create_data_#res.base|))), 16783#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 8 (select |#length| |append_#t~ret17.base|)) (= 0 |append_#t~ret17.offset|)) (= append_~node~0.base append_~pointerToList.base))), 16784#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 8 (select |#length| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) append_~node~0.offset))) (= append_~node~0.base append_~pointerToList.base))), 16785#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 16786#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 16787#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 16788#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)))), 16789#(and (= 8 (select |#length| |main_#t~mem24.base|)) (= 0 |main_#t~mem24.offset|)), 16790#(and (= 0 |freeData_#in~data.offset|) (= 8 (select |#length| |freeData_#in~data.base|))), 16791#(and (= (select |#length| freeData_~data.base) 8) (= 0 freeData_~data.offset))] [2018-02-02 20:17:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:17:05,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:17:05,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:17:05,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:17:05,154 INFO L87 Difference]: Start difference. First operand 243 states and 277 transitions. Second operand 21 states. [2018-02-02 20:17:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:05,900 INFO L93 Difference]: Finished difference Result 282 states and 318 transitions. [2018-02-02 20:17:05,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:17:05,900 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-02-02 20:17:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:05,901 INFO L225 Difference]: With dead ends: 282 [2018-02-02 20:17:05,901 INFO L226 Difference]: Without dead ends: 282 [2018-02-02 20:17:05,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:17:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-02 20:17:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 243. [2018-02-02 20:17:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 20:17:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 275 transitions. [2018-02-02 20:17:05,905 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 275 transitions. Word has length 67 [2018-02-02 20:17:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:05,905 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 275 transitions. [2018-02-02 20:17:05,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:17:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 275 transitions. [2018-02-02 20:17:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:17:05,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:05,906 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:17:05,906 INFO L371 AbstractCegarLoop]: === Iteration 50 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:05,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1528121714, now seen corresponding path program 2 times [2018-02-02 20:17:05,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:05,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:05,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:05,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:17:05,930 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:05,930 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-02 20:17:05,930 INFO L182 omatonBuilderFactory]: Interpolants [17365#true, 17366#false, 17367#(= create_data_~counter~0 0), 17368#(<= create_data_~counter~0 1), 17369#(<= create_data_~counter~0 2), 17370#(<= create_data_~counter~0 3)] [2018-02-02 20:17:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:05,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:17:05,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:17:05,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:17:05,931 INFO L87 Difference]: Start difference. First operand 243 states and 275 transitions. Second operand 6 states. [2018-02-02 20:17:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:05,945 INFO L93 Difference]: Finished difference Result 255 states and 287 transitions. [2018-02-02 20:17:05,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:17:05,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-02-02 20:17:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:05,955 INFO L225 Difference]: With dead ends: 255 [2018-02-02 20:17:05,956 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 20:17:05,956 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:17:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 20:17:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 250. [2018-02-02 20:17:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-02 20:17:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 282 transitions. [2018-02-02 20:17:05,958 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 282 transitions. Word has length 54 [2018-02-02 20:17:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:05,958 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 282 transitions. [2018-02-02 20:17:05,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:17:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 282 transitions. [2018-02-02 20:17:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:17:05,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:05,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:17:05,959 INFO L371 AbstractCegarLoop]: === Iteration 51 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:05,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2023698147, now seen corresponding path program 1 times [2018-02-02 20:17:05,960 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:05,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:06,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-02 20:17:06,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:17:06,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-02-02 20:17:06,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:06,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-02 20:17:06,580 INFO L182 omatonBuilderFactory]: Interpolants [17876#true, 17877#false, 17878#(not (= |main_~#list~0.base| 0)), 17879#(and (not (= |main_~#list~0.base| 0)) (= (select |#valid| |main_~#list~0.base|) 1)), 17880#(= |#valid| |old(#valid)|), 17881#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 17882#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 17883#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 17884#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (= 1 (select |#valid| append_~pointerToList.base))), 17885#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (= 1 (select |#valid| append_~pointerToList.base)) (= (select |#valid| append_~node~0.base) 1)), 17886#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 17887#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 17888#(and (= 0 create_data_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base))), 17889#(and (= 0 (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)) (= 0 (select |old(#valid)| |create_data_#res.base|))), 17890#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (= 0 (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|)) |append_#t~ret17.base|) 4)) (not (= append_~pointerToList.base |append_#t~ret17.base|))), 17891#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= append_~pointerToList.base (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) 4))))), 17892#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) 4)) (= 1 (select |#valid| |append_#in~pointerToList.base|)) (not (= |append_#in~pointerToList.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))))), 17893#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4))) (= 1 (select |#valid| |main_~#list~0.base|))), 17894#(and (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4))) (= 1 (select |#valid| |main_~#list~0.base|))), 17895#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4))) (= 1 (select |#valid| |main_~#list~0.base|))), 17896#(and (not (= |main_~#list~0.base| |main_#t~mem24.base|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) 4))) (= 1 (select |#valid| |main_~#list~0.base|))), 17897#(and (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 17898#(or (and (= |#valid| |old(#valid)|) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 17899#(or (and (= |freeData_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4))) (= |#valid| |old(#valid)|) (= |freeData_#t~mem12.base| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 17900#(or (and (= |#valid| |old(#valid)|) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|) (or (not (= (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))))) (not (= 0 freeData_~data.offset))), 17901#(or (and (or (not (= 0 |freeData_#t~mem13.base|)) (not (= |freeData_#t~mem13.offset| 0))) (= |#valid| |old(#valid)|) (not (= freeData_~data.base 0)) (= (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)) |freeData_#t~mem13.base|) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 17902#(or (and (= |freeData_#in~data.base| freeData_~data.base) (or (= (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)) (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (not (= freeData_~data.base 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 freeData_~data.offset))), 17903#(and (or (= |freeData_#in~data.base| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (and (= (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4) (@diff |old(#valid)| |#valid|)) (= (select |#valid| |freeData_#in~data.base|) 0)) (= |#valid| |old(#valid)|) (and (= (select |#valid| (@diff |old(#valid)| |#valid|)) 0) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|))))), 17904#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 20:17:06,580 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-02 20:17:06,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:17:06,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:17:06,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:17:06,581 INFO L87 Difference]: Start difference. First operand 250 states and 282 transitions. Second operand 29 states. [2018-02-02 20:17:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:07,530 INFO L93 Difference]: Finished difference Result 274 states and 309 transitions. [2018-02-02 20:17:07,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:17:07,531 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-02-02 20:17:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:07,532 INFO L225 Difference]: With dead ends: 274 [2018-02-02 20:17:07,532 INFO L226 Difference]: Without dead ends: 274 [2018-02-02 20:17:07,532 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=2116, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:17:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-02 20:17:07,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 254. [2018-02-02 20:17:07,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-02-02 20:17:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 286 transitions. [2018-02-02 20:17:07,535 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 286 transitions. Word has length 56 [2018-02-02 20:17:07,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:07,535 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 286 transitions. [2018-02-02 20:17:07,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:17:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 286 transitions. [2018-02-02 20:17:07,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 20:17:07,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:07,536 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:17:07,536 INFO L371 AbstractCegarLoop]: === Iteration 52 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:07,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1689866953, now seen corresponding path program 1 times [2018-02-02 20:17:07,536 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:07,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:08,249 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-02 20:17:08,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:17:08,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-02 20:17:08,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:08,250 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-02 20:17:08,250 INFO L182 omatonBuilderFactory]: Interpolants [18496#(or (and (= |freeData_#in~data.base| freeData_~data.base) (not (= freeData_~data.base 0)) (or (and (= (select (store |#valid| freeData_~data.base 0) (@diff |old(#valid)| |#valid|)) 0) (= (@diff |old(#valid)| |#valid|) (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))) (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= 0 freeData_~data.offset))), 18497#(and (or (= |#valid| |old(#valid)|) (and (= (select |#valid| (@diff |old(#valid)| |#valid|)) (select |#valid| |freeData_#in~data.base|)) (= (@diff |old(#valid)| |#valid|) (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4))) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= |freeData_#in~data.base| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (and (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (select |#valid| |freeData_#in~data.base|)) (= (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))), 18498#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select |#valid| |main_~#list~0.base|))), 18499#(= 1 (select |#valid| |main_#t~mem25.base|)), 18473#true, 18474#false, 18475#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= |append_#in~pointerToList.base| append_~pointerToList.base)), 18476#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 |append_#t~malloc14.base|)) (= |append_#in~pointerToList.base| append_~pointerToList.base)), 18477#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= |append_#in~pointerToList.base| append_~pointerToList.base) (not (= 0 append_~node~0.base))), 18478#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= |append_#in~pointerToList.base| append_~pointerToList.base) (not (= 0 append_~node~0.base)) (= (select |#valid| append_~node~0.base) 1)), 18479#(= |#valid| |old(#valid)|), 18480#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 18481#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 18482#(and (= 0 create_data_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base))), 18483#(and (= 0 (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)) (= 0 (select |old(#valid)| |create_data_#res.base|))), 18484#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= append_~node~0.base |append_#t~ret17.base|)) (= |append_#in~pointerToList.base| append_~pointerToList.base) (or (= |append_#t~ret17.base| |append_#in~pointerToList.base|) (not (= (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|)) |append_#t~ret17.base|) 4) append_~node~0.base)))), 18485#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (or (and (not (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))) (= 1 (select |#valid| append_~node~0.base)) (or (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset) |append_#in~pointerToList.base|) (not (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) 4) append_~node~0.base)))) (= append_~node~0.base append_~pointerToList.base)) (= |append_#in~pointerToList.base| append_~pointerToList.base)), 18486#(or (= |append_#in~pointerToList.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (and (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) 4) (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) |append_#in~pointerToList.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (not (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))))), 18487#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 18488#(or (and (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 18489#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 18490#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) 4) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| |main_#t~mem24.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem24.base|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 18491#(and (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 18492#(or (and (= |#valid| |old(#valid)|) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 18493#(or (and (= |freeData_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4))) (= |#valid| |old(#valid)|) (= |freeData_#t~mem12.base| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 18494#(or (and (= |#valid| |old(#valid)|) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|) (or (not (= (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))))) (not (= 0 freeData_~data.offset))), 18495#(or (and (or (not (= 0 |freeData_#t~mem13.base|)) (not (= |freeData_#t~mem13.offset| 0))) (= |#valid| |old(#valid)|) (= |freeData_#t~mem13.base| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset)))] [2018-02-02 20:17:08,250 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-02 20:17:08,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:17:08,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:17:08,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:17:08,251 INFO L87 Difference]: Start difference. First operand 254 states and 286 transitions. Second operand 27 states. [2018-02-02 20:17:09,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:09,319 INFO L93 Difference]: Finished difference Result 280 states and 314 transitions. [2018-02-02 20:17:09,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:17:09,320 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 57 [2018-02-02 20:17:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:09,321 INFO L225 Difference]: With dead ends: 280 [2018-02-02 20:17:09,321 INFO L226 Difference]: Without dead ends: 280 [2018-02-02 20:17:09,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=264, Invalid=2388, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 20:17:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-02 20:17:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 244. [2018-02-02 20:17:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 20:17:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 276 transitions. [2018-02-02 20:17:09,323 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 276 transitions. Word has length 57 [2018-02-02 20:17:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:09,323 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 276 transitions. [2018-02-02 20:17:09,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:17:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 276 transitions. [2018-02-02 20:17:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 20:17:09,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:09,324 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:17:09,324 INFO L371 AbstractCegarLoop]: === Iteration 53 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash 195535773, now seen corresponding path program 1 times [2018-02-02 20:17:09,324 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:09,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:09,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:17:09,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 20:17:09,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:09,629 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-02 20:17:09,629 INFO L182 omatonBuilderFactory]: Interpolants [19074#true, 19075#false, 19076#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 19077#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 19078#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0)), 19079#(not (= |create_data_#t~malloc1.base| 0)), 19080#(not (= create_data_~data~0.base 0)), 19081#(not (= |create_data_#res.base| 0)), 19082#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (not (= |append_#t~ret17.base| 0))), 19083#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) 0)))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 19084#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) 0))), 19085#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 19086#(or (and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) 0))), 19087#(or (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) 0))), 19088#(or (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) 0))) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 19089#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= |main_#t~mem24.base| 0)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 19090#(= freeData_~data.base |freeData_#in~data.base|), 19091#(= 0 |freeData_#in~data.base|), 19092#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 19093#(or (not (= 0 |main_#t~mem25.offset|)) (and (not (= |main_#t~mem25.base| 0)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 19094#(and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))] [2018-02-02 20:17:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:09,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:17:09,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:17:09,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:17:09,630 INFO L87 Difference]: Start difference. First operand 244 states and 276 transitions. Second operand 21 states. [2018-02-02 20:17:10,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:10,265 INFO L93 Difference]: Finished difference Result 275 states and 305 transitions. [2018-02-02 20:17:10,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:17:10,265 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-02-02 20:17:10,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:10,266 INFO L225 Difference]: With dead ends: 275 [2018-02-02 20:17:10,266 INFO L226 Difference]: Without dead ends: 266 [2018-02-02 20:17:10,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:17:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-02-02 20:17:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 249. [2018-02-02 20:17:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-02-02 20:17:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 279 transitions. [2018-02-02 20:17:10,269 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 279 transitions. Word has length 58 [2018-02-02 20:17:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:10,270 INFO L432 AbstractCegarLoop]: Abstraction has 249 states and 279 transitions. [2018-02-02 20:17:10,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:17:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 279 transitions. [2018-02-02 20:17:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:17:10,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:10,271 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-02-02 20:17:10,271 INFO L371 AbstractCegarLoop]: === Iteration 54 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1320961102, now seen corresponding path program 1 times [2018-02-02 20:17:10,271 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:10,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:17:10,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:10,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:17:10,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:17:10,409 INFO L182 omatonBuilderFactory]: Interpolants [19655#true, 19656#false, 19657#(= append_~pointerToList.base |append_#in~pointerToList.base|), 19658#(= 1 (select |#valid| |append_#in~pointerToList.base|)), 19659#(= 1 (select |#valid| |main_~#list~0.base|)), 19660#(= |#valid| |old(#valid)|), 19661#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 19662#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 19663#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base))), 19664#(= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 19665#(not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 19666#(and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 19667#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 19668#(and (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0))) (not (= |main_~#list~0.base| |main_#t~mem25.base|)) (= 1 (select |#valid| |main_~#list~0.base|)))] [2018-02-02 20:17:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:17:10,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:17:10,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:17:10,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:17:10,409 INFO L87 Difference]: Start difference. First operand 249 states and 279 transitions. Second operand 14 states. [2018-02-02 20:17:10,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:10,674 INFO L93 Difference]: Finished difference Result 259 states and 284 transitions. [2018-02-02 20:17:10,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:17:10,674 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2018-02-02 20:17:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:10,675 INFO L225 Difference]: With dead ends: 259 [2018-02-02 20:17:10,675 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 20:17:10,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:17:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 20:17:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 200. [2018-02-02 20:17:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 20:17:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2018-02-02 20:17:10,677 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 73 [2018-02-02 20:17:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:10,677 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2018-02-02 20:17:10,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:17:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2018-02-02 20:17:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:17:10,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:10,678 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:17:10,678 INFO L371 AbstractCegarLoop]: === Iteration 55 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:10,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1492741583, now seen corresponding path program 1 times [2018-02-02 20:17:10,678 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:10,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:11,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:11,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:17:11,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:11,222 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-02 20:17:11,222 INFO L182 omatonBuilderFactory]: Interpolants [20160#(and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20161#(and (= (store |old(#memory_$Pointer$.offset)| create_data_~data~0.base (select |#memory_$Pointer$.offset| create_data_~data~0.base)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| create_data_~data~0.base (select |#memory_$Pointer$.base| create_data_~data~0.base)))), 20162#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)), 20163#(and (= 0 append_~node~0.offset) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (store (select |#memory_$Pointer$.offset| append_~node~0.base) append_~node~0.offset |append_#t~ret17.offset|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|) (+ append_~node~0.offset 4)))))), 20164#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (and (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 20165#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))))), 20166#(and (= |main_#t~mem21.offset| 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 20167#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 |main_#t~mem22.base|) (= 0 |main_#t~mem22.offset|))), 20168#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base))), 20169#(or (and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base))), 20170#(or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 20171#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.base| 0)), 20149#true, 20150#false, 20151#(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|))), 20152#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20153#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20154#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20155#(and (= 0 append_~node~0.offset) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 20156#(and (= 0 append_~node~0.offset) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 20157#(and (= 0 append_~node~0.offset) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~node~0.base) 1) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))) (= append_~node~0.base append_~pointerToList.base)) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 20158#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 20159#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 20:17:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:11,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:17:11,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:17:11,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:17:11,222 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 23 states. [2018-02-02 20:17:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:12,077 INFO L93 Difference]: Finished difference Result 228 states and 251 transitions. [2018-02-02 20:17:12,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:17:12,077 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2018-02-02 20:17:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:12,078 INFO L225 Difference]: With dead ends: 228 [2018-02-02 20:17:12,078 INFO L226 Difference]: Without dead ends: 228 [2018-02-02 20:17:12,078 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=1181, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:17:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-02 20:17:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 219. [2018-02-02 20:17:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 20:17:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 241 transitions. [2018-02-02 20:17:12,081 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 241 transitions. Word has length 61 [2018-02-02 20:17:12,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:12,081 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 241 transitions. [2018-02-02 20:17:12,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:17:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 241 transitions. [2018-02-02 20:17:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:17:12,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:12,082 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 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] [2018-02-02 20:17:12,082 INFO L371 AbstractCegarLoop]: === Iteration 56 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:12,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1767716282, now seen corresponding path program 2 times [2018-02-02 20:17:12,083 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:12,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:17:12,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:12,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:17:12,129 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:17:12,129 INFO L182 omatonBuilderFactory]: Interpolants [20647#true, 20648#false, 20649#(= create_data_~counter~0 0), 20650#(<= create_data_~counter~0 1), 20651#(<= create_data_~counter~0 2), 20652#(<= create_data_~counter~0 3), 20653#(<= create_data_~counter~0 4)] [2018-02-02 20:17:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:17:12,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:17:12,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:17:12,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:17:12,130 INFO L87 Difference]: Start difference. First operand 219 states and 241 transitions. Second operand 7 states. [2018-02-02 20:17:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:12,152 INFO L93 Difference]: Finished difference Result 231 states and 253 transitions. [2018-02-02 20:17:12,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:17:12,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-02-02 20:17:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:12,153 INFO L225 Difference]: With dead ends: 231 [2018-02-02 20:17:12,154 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 20:17:12,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:17:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 20:17:12,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 226. [2018-02-02 20:17:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 20:17:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2018-02-02 20:17:12,157 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 81 [2018-02-02 20:17:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:12,157 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2018-02-02 20:17:12,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:17:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2018-02-02 20:17:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:17:12,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:12,158 INFO L351 BasicCegarLoop]: trace histogram [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-02 20:17:12,158 INFO L371 AbstractCegarLoop]: === Iteration 57 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:12,158 INFO L82 PathProgramCache]: Analyzing trace with hash -6569714, now seen corresponding path program 1 times [2018-02-02 20:17:12,159 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:12,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:13,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:13,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:17:13,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:13,101 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-02 20:17:13,101 INFO L182 omatonBuilderFactory]: Interpolants [21120#(and (= (store |#valid| |create_data_#t~malloc1.base| (select |old(#valid)| |create_data_#t~malloc1.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|))), 21121#(and (= (store |#valid| create_data_~data~0.base (select |old(#valid)| create_data_~data~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| create_data_~data~0.base))), 21122#(and (= |old(#valid)| (store |#valid| |create_data_#res.base| (select |old(#valid)| |create_data_#res.base|))) (= 0 (select |old(#valid)| |create_data_#res.base|))), 21123#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (not (= append_~node~0.base |append_#t~ret17.base|)) (= 0 (select |old(#valid)| |append_#t~ret17.base|)) (not (= |append_#in~pointerToList.base| |append_#t~ret17.base|)) (= (store (store |#valid| append_~node~0.base (select |old(#valid)| append_~node~0.base)) |append_#t~ret17.base| (select |old(#valid)| |append_#t~ret17.base|)) |old(#valid)|))) (not (= 0 append_~node~0.base)) (or (not (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.base |append_#in~pointerToList.base|))), 21124#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (or (and (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= 0 (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))) (= (store (store |#valid| append_~node~0.base (select |old(#valid)| append_~node~0.base)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset) (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))) |old(#valid)|) (not (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))) (not (= |append_#in~pointerToList.base| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)))) (= append_~node~0.base append_~pointerToList.base)) (not (= 0 append_~node~0.base)) (or (not (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.base |append_#in~pointerToList.base|))), 21125#(and (or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (not (= |append_#in~pointerToList.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))))) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 21126#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21127#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21128#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21129#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (and (= (store (store (store |#valid| |main_#t~mem24.base| 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (not (= |main_~#list~0.base| |main_#t~mem24.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem24.base|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21130#(and (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 21131#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 21132#(and (= |old(#valid)| (store |#valid| |freeData_#in~data.base| (select |old(#valid)| |freeData_#in~data.base|))) (= (select |#valid| |freeData_#in~data.base|) 0)), 21133#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (= (store (store |#valid| |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21134#(and (or (and (= (store (store |#valid| |main_~#list~0.base| 0) |main_#t~mem25.base| (select (store |#valid| |main_#t~mem25.base| 0) |main_#t~mem25.base|)) |old(#valid)|) (not (= |main_#t~mem25.base| |main_~#list~0.base|))) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= 0 |main_#t~mem25.base|))), 21135#(or (= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21111#true, 21112#false, 21113#(= |#valid| |old(#valid)|), 21114#(= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|), 21115#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 21116#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 (select |old(#valid)| |append_#t~malloc14.base|)) (= |old(#valid)| (store |#valid| |append_#t~malloc14.base| (select |old(#valid)| |append_#t~malloc14.base|)))), 21117#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (or (= |#valid| |old(#valid)|) (= append_~node~0.base (@diff |#valid| |old(#valid)|))))) (or (not (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.base |append_#in~pointerToList.base|))), 21118#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= (select |#valid| |append_#in~pointerToList.base|) 1) (not (= 0 append_~node~0.base)) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (or (= |#valid| |old(#valid)|) (= append_~node~0.base (@diff |#valid| |old(#valid)|))))) (or (not (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.base |append_#in~pointerToList.base|))), 21119#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= (select |#valid| |append_#in~pointerToList.base|) 1) (not (= 0 append_~node~0.base)) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) (= (select |#valid| append_~node~0.base) 1) (or (not (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))] [2018-02-02 20:17:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:13,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:17:13,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:17:13,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:17:13,102 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand 25 states. [2018-02-02 20:17:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:14,313 INFO L93 Difference]: Finished difference Result 244 states and 268 transitions. [2018-02-02 20:17:14,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:17:14,313 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2018-02-02 20:17:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:14,314 INFO L225 Difference]: With dead ends: 244 [2018-02-02 20:17:14,314 INFO L226 Difference]: Without dead ends: 232 [2018-02-02 20:17:14,315 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=141, Invalid=1419, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:17:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-02-02 20:17:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2018-02-02 20:17:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-02-02 20:17:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 251 transitions. [2018-02-02 20:17:14,317 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 251 transitions. Word has length 63 [2018-02-02 20:17:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:14,318 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 251 transitions. [2018-02-02 20:17:14,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:17:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 251 transitions. [2018-02-02 20:17:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:17:14,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:14,318 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:17:14,318 INFO L371 AbstractCegarLoop]: === Iteration 58 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1226100464, now seen corresponding path program 1 times [2018-02-02 20:17:14,319 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:14,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:14,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:14,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:17:14,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:14,856 INFO L182 omatonBuilderFactory]: Interpolants [21639#true, 21640#false, 21641#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 21642#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| |append_#t~malloc14.base|))), 21643#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 21644#(= |#valid| |old(#valid)|), 21645#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 21646#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 21647#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21648#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21649#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= (select |old(#valid)| |append_#t~malloc14.base|) 0) (= |#valid| (store |old(#valid)| |append_#t~malloc14.base| (select |#valid| |append_#t~malloc14.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21650#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (not (= 0 append_~node~0.base)) (= |#valid| (store |old(#valid)| append_~node~0.base (select |#valid| append_~node~0.base))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| append_~node~0.base) 0)), 21651#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (not (= 0 append_~node~0.base)) (= |#valid| (store |old(#valid)| append_~node~0.base (select |#valid| append_~node~0.base))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select |old(#valid)| append_~node~0.base) 0) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|)), 21652#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (not (= 0 append_~node~0.base)) (= |#valid| (store |old(#valid)| append_~node~0.base (select |#valid| append_~node~0.base))) (= (select |old(#valid)| append_~node~0.base) 0) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))), 21653#(and (= 0 append_~node~0.offset) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) (+ append_~node~0.offset 4))) (= |#valid| (store |old(#valid)| append_~node~0.base (select |#valid| append_~node~0.base))) (= (select |old(#valid)| append_~node~0.base) 0))) (not (= 0 append_~node~0.base)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base)))), 21654#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4)) (= |#valid| (store |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 21655#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21656#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.offset| 0)), 21657#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_#t~mem22.base|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21658#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (= 1 (select (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) main_~next~0.base)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 21659#(and (or (= 1 (select (store |#valid| |main_#t~mem25.base| 0) main_~next~0.base)) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= 0 |main_#t~mem25.base|))), 21660#(or (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| main_~next~0.base))), 21661#(= 1 (select |#valid| |main_#t~mem21.base|))] [2018-02-02 20:17:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:14,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:17:14,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:17:14,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:17:14,857 INFO L87 Difference]: Start difference. First operand 229 states and 251 transitions. Second operand 23 states. [2018-02-02 20:17:15,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:15,799 INFO L93 Difference]: Finished difference Result 263 states and 293 transitions. [2018-02-02 20:17:15,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:17:15,800 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-02-02 20:17:15,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:15,801 INFO L225 Difference]: With dead ends: 263 [2018-02-02 20:17:15,801 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 20:17:15,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=218, Invalid=1762, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:17:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 20:17:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 239. [2018-02-02 20:17:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 20:17:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 263 transitions. [2018-02-02 20:17:15,806 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 263 transitions. Word has length 71 [2018-02-02 20:17:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:15,806 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 263 transitions. [2018-02-02 20:17:15,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:17:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 263 transitions. [2018-02-02 20:17:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:17:15,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:15,807 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:17:15,807 INFO L371 AbstractCegarLoop]: === Iteration 59 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:15,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1226100465, now seen corresponding path program 1 times [2018-02-02 20:17:15,808 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:15,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:16,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:16,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:17:16,605 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:16,605 INFO L182 omatonBuilderFactory]: Interpolants [22209#true, 22210#false, 22211#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 22212#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 22213#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 8 (select |#length| append_~node~0.base))), 22214#(= |old(#length)| |#length|), 22215#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 22216#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 22217#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22218#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22219#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= (store |old(#length)| |append_#t~malloc14.base| (select |#length| |append_#t~malloc14.base|)) |#length|) (= (select |#length| |append_#t~malloc14.base|) 8) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 22220#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (= 0 append_~node~0.offset) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 22221#(and (= 0 append_~node~0.offset) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= |append_#t~mem16.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))), 22222#(and (= 0 append_~node~0.offset) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 22223#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 22224#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 22225#(and (or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_#t~mem21.offset| 0)), 22226#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 |main_#t~mem22.offset|) (<= 8 (select |#length| |main_#t~mem22.base|)))), 22227#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset))), 22228#(or (and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset))), 22229#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 22230#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 22231#(and (= |main_#t~mem21.offset| 0) (<= 8 (select |#length| |main_#t~mem21.base|)))] [2018-02-02 20:17:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:16,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:17:16,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:17:16,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:17:16,606 INFO L87 Difference]: Start difference. First operand 239 states and 263 transitions. Second operand 23 states. [2018-02-02 20:17:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:17,859 INFO L93 Difference]: Finished difference Result 289 states and 326 transitions. [2018-02-02 20:17:17,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:17:17,860 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 71 [2018-02-02 20:17:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:17,860 INFO L225 Difference]: With dead ends: 289 [2018-02-02 20:17:17,860 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 20:17:17,861 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=219, Invalid=1673, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:17:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 20:17:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 262. [2018-02-02 20:17:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-02-02 20:17:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 292 transitions. [2018-02-02 20:17:17,863 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 292 transitions. Word has length 71 [2018-02-02 20:17:17,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:17,864 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 292 transitions. [2018-02-02 20:17:17,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:17:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 292 transitions. [2018-02-02 20:17:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 20:17:17,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:17,864 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-02-02 20:17:17,864 INFO L371 AbstractCegarLoop]: === Iteration 60 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:17,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1384233511, now seen corresponding path program 1 times [2018-02-02 20:17:17,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:17,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:18,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:17:18,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-02-02 20:17:18,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:18,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-02 20:17:18,449 INFO L182 omatonBuilderFactory]: Interpolants [22848#(or (and (or (not (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))) (not (= |freeData_#t~mem13.offset| 0))) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 22849#(or (and (not (= freeData_~data.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 22850#(and (not (= 0 (select (select |#memory_$Pointer$.base| |freeData_#in~data.base|) 4))) (= 0 (select |#valid| |freeData_#in~data.base|))), 22851#(or (= 0 (select |#valid| |main_~#list~0.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 22852#(and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 22853#(and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 22826#true, 22827#false, 22828#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 22829#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|))), 22830#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (not (= append_~node~0.base append_~pointerToList.base)) (not (= 0 append_~node~0.base)))), 22831#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select |#valid| append_~node~0.base) 1) (or (not (= append_~node~0.base append_~pointerToList.base)) (not (= 0 append_~node~0.base)))), 22832#(= |#valid| |old(#valid)|), 22833#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= 0 |create_data_#t~malloc1.offset|)), 22834#(and (= 0 create_data_~data~0.offset) (= 0 (select |old(#valid)| create_data_~data~0.base))), 22835#(and (= 0 create_data_~data~0.offset) (= 0 (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (+ create_data_~data~0.offset 4))) (= 0 (select |old(#valid)| create_data_~data~0.base))), 22836#(and (= 0 (select (select |#memory_$Pointer$.base| |create_data_#res.base|) 4)) (= 0 (select |old(#valid)| |create_data_#res.base|))), 22837#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|)) |append_#t~ret17.base|) 4)) (= |append_#t~ret17.base| |append_#in~pointerToList.base|)) (or (not (= append_~node~0.base append_~pointerToList.base)) (not (= 0 append_~node~0.base)))), 22838#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset) |append_#in~pointerToList.base|)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset)) 4)))) (or (not (= append_~node~0.base append_~pointerToList.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 22839#(or (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) |append_#in~pointerToList.base|) (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 22840#(or (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 22841#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4)) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 22842#(or (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|)) 4)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 22843#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| |main_#t~mem24.base|) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem24.base|) 4))), 22844#(= freeData_~data.base |freeData_#in~data.base|), 22845#(or (and (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 22846#(or (and (= |freeData_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4))) (= |freeData_#t~mem12.base| (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4))) (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|)) (not (= 0 freeData_~data.offset))), 22847#(or (and (not (= freeData_~data.base 0)) (= freeData_~data.base |freeData_#in~data.base|) (or (not (= (select (select |#memory_$Pointer$.offset| freeData_~data.base) (+ freeData_~data.offset 4)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| freeData_~data.base) (+ freeData_~data.offset 4)))))) (not (= 0 freeData_~data.offset)))] [2018-02-02 20:17:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:18,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:17:18,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:17:18,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:17:18,449 INFO L87 Difference]: Start difference. First operand 262 states and 292 transitions. Second operand 28 states. [2018-02-02 20:17:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:19,569 INFO L93 Difference]: Finished difference Result 277 states and 307 transitions. [2018-02-02 20:17:19,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 20:17:19,570 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 66 [2018-02-02 20:17:19,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:19,570 INFO L225 Difference]: With dead ends: 277 [2018-02-02 20:17:19,570 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 20:17:19,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=316, Invalid=2990, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:17:19,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 20:17:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2018-02-02 20:17:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 20:17:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 266 transitions. [2018-02-02 20:17:19,574 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 266 transitions. Word has length 66 [2018-02-02 20:17:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:19,574 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 266 transitions. [2018-02-02 20:17:19,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:17:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 266 transitions. [2018-02-02 20:17:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:17:19,575 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:19,575 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:17:19,576 INFO L371 AbstractCegarLoop]: === Iteration 61 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:19,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1460521485, now seen corresponding path program 1 times [2018-02-02 20:17:19,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:19,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:19,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:19,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:17:19,974 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:19,974 INFO L182 omatonBuilderFactory]: Interpolants [23430#true, 23431#false, 23432#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 23433#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|))), 23434#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 append_~node~0.base))), 23435#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 23436#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 23437#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 23438#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 23439#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 23440#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 23441#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|)), 23442#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))), 23443#(and (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) (+ append_~node~0.offset 4)))))), 23444#(or (and (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 23445#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))))), 23446#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))))), 23447#(or (not (= 0 |main_#t~mem22.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 23448#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 main_~next~0.base))), 23449#(or (and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 main_~next~0.base))), 23450#(or (not (= 0 main_~next~0.base)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 23451#(not (= 0 |main_#t~mem27.base|))] [2018-02-02 20:17:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:19,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:17:19,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:17:19,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:17:19,975 INFO L87 Difference]: Start difference. First operand 239 states and 266 transitions. Second operand 22 states. [2018-02-02 20:17:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:20,763 INFO L93 Difference]: Finished difference Result 268 states and 301 transitions. [2018-02-02 20:17:20,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:17:20,763 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 73 [2018-02-02 20:17:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:20,764 INFO L225 Difference]: With dead ends: 268 [2018-02-02 20:17:20,764 INFO L226 Difference]: Without dead ends: 268 [2018-02-02 20:17:20,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=1723, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 20:17:20,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-02 20:17:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 239. [2018-02-02 20:17:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 20:17:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 264 transitions. [2018-02-02 20:17:20,767 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 264 transitions. Word has length 73 [2018-02-02 20:17:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:20,767 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 264 transitions. [2018-02-02 20:17:20,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:17:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 264 transitions. [2018-02-02 20:17:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:17:20,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:20,768 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-02-02 20:17:20,768 INFO L371 AbstractCegarLoop]: === Iteration 62 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:20,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1756723881, now seen corresponding path program 1 times [2018-02-02 20:17:20,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:20,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:22,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:22,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 20:17:22,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:22,145 INFO L182 omatonBuilderFactory]: Interpolants [24006#true, 24007#false, 24008#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 24009#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 1 (select |#valid| append_~node~0.base))), 24010#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 24011#(= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1), 24012#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24013#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24014#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= 0 (select |old(#valid)| |append_#t~malloc14.base|)) (= |#valid| (store |old(#valid)| |append_#t~malloc14.base| (select |#valid| |append_#t~malloc14.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24015#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.offset 0) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24016#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.offset 0) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24017#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.offset 0) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24018#(and (= |#valid| (store |old(#valid)| |create_data_#t~malloc1.base| (select |#valid| |create_data_#t~malloc1.base|))) (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24019#(and (or (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24020#(and (or (= |#valid| |old(#valid)|) (= create_data_~data~0.base (@diff |old(#valid)| |#valid|))) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| create_data_~data~0.base (select |#memory_$Pointer$.base| create_data_~data~0.base))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24021#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= 0 (select |old(#valid)| |create_data_#res.base|)) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |#valid| |old(#valid)|) (= |create_data_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24022#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (and (= append_~node~0.offset 0) (= |append_#t~ret17.base| append_~node~0.base)) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= 0 (select |old(#valid)| |append_#t~ret17.base|)) (or (= append_~node~0.base (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= |append_#t~ret17.base| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= append_~node~0.offset 0) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|) (= |append_#t~ret17.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset))))), 24023#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) (+ append_~node~0.offset 4))) (= append_~node~0.offset 0) (= 0 (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) append_~node~0.offset))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|) (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) (@diff |old(#valid)| |#valid|))) (or (= append_~node~0.base (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= append_~node~0.base append_~pointerToList.base) (and (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) append_~node~0.base) (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 24024#(or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0))) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4)) (or (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff |old(#valid)| |#valid|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (@diff |old(#valid)| |#valid|))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 24025#(or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 24026#(and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24027#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24028#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (or (not (= 0 |main_#t~mem21.offset|)) (and (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= 0 |main_#t~mem21.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)) (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24029#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (not (= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))) (= 1 (select |#valid| |main_#t~mem22.base|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24030#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))) (= 1 (select |#valid| main_~next~0.base))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24031#(and (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))) (= 1 (select |#valid| main_~next~0.base)))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))), 24032#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (not (= main_~next~0.base |main_#t~mem24.base|)) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| main_~next~0.base))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24033#(= |#valid| |old(#valid)|), 24034#(and (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 24035#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= |#valid| |old(#valid)|) (= freeData_~data.base |freeData_#in~data.base|)), 24036#(and (or (= |#valid| |old(#valid)|) (= |freeData_#in~data.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))) (= 0 (select |#valid| |freeData_#in~data.base|))), 24037#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| main_~next~0.base))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24038#(and (or (= 0 (select |#valid| |main_#t~mem25.base|)) (= 1 (select (store |#valid| |main_#t~mem25.base| 0) main_~next~0.base)) (not (= |main_#t~mem25.offset| 0)) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0)))), 24039#(or (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| main_~next~0.base))), 24040#(= 1 (select |#valid| |main_#t~mem21.base|))] [2018-02-02 20:17:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:22,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 20:17:22,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 20:17:22,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:17:22,145 INFO L87 Difference]: Start difference. First operand 239 states and 264 transitions. Second operand 35 states. [2018-02-02 20:17:22,951 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 75 DAG size of output 74 [2018-02-02 20:17:23,322 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 80 DAG size of output 79 [2018-02-02 20:17:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:25,175 INFO L93 Difference]: Finished difference Result 273 states and 306 transitions. [2018-02-02 20:17:25,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 20:17:25,179 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 81 [2018-02-02 20:17:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:25,180 INFO L225 Difference]: With dead ends: 273 [2018-02-02 20:17:25,180 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 20:17:25,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=319, Invalid=4511, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 20:17:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 20:17:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 247. [2018-02-02 20:17:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-02 20:17:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 273 transitions. [2018-02-02 20:17:25,185 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 273 transitions. Word has length 81 [2018-02-02 20:17:25,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:25,186 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 273 transitions. [2018-02-02 20:17:25,186 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 20:17:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 273 transitions. [2018-02-02 20:17:25,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:17:25,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:25,186 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:17:25,187 INFO L371 AbstractCegarLoop]: === Iteration 63 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:25,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1937872819, now seen corresponding path program 1 times [2018-02-02 20:17:25,187 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:25,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:25,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:25,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:17:25,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:25,625 INFO L182 omatonBuilderFactory]: Interpolants [24640#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 24641#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24642#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24643#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24644#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= append_~node~0.offset 0) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24645#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 24646#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= append_~node~0.offset 0))) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 24647#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 24648#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24649#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) (= |main_#t~mem21.offset| 0))), 24650#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 |main_#t~mem22.offset|)), 24651#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset)), 24652#(or (and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset)), 24653#(or (= 0 main_~next~0.offset) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24654#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 24655#(and (= |main_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.offset| 0)), 24656#(and (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 24657#(and (<= 0 |main_#t~mem23.offset|) (<= (+ |main_#t~mem23.offset| 8) (select |#length| |main_#t~mem23.base|))), 24633#true, 24634#false, 24635#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 24636#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 24637#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 24638#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 24639#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))] [2018-02-02 20:17:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:25,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:17:25,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:17:25,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:17:25,626 INFO L87 Difference]: Start difference. First operand 247 states and 273 transitions. Second operand 25 states. [2018-02-02 20:17:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:26,796 INFO L93 Difference]: Finished difference Result 272 states and 301 transitions. [2018-02-02 20:17:26,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:17:26,796 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-02-02 20:17:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:26,797 INFO L225 Difference]: With dead ends: 272 [2018-02-02 20:17:26,797 INFO L226 Difference]: Without dead ends: 272 [2018-02-02 20:17:26,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=370, Invalid=2710, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:17:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-02 20:17:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 252. [2018-02-02 20:17:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-02 20:17:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 279 transitions. [2018-02-02 20:17:26,800 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 279 transitions. Word has length 74 [2018-02-02 20:17:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:26,800 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 279 transitions. [2018-02-02 20:17:26,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:17:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 279 transitions. [2018-02-02 20:17:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:17:26,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:26,801 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-02-02 20:17:26,801 INFO L371 AbstractCegarLoop]: === Iteration 64 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:26,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1756723882, now seen corresponding path program 1 times [2018-02-02 20:17:26,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:26,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:28,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:28,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 20:17:28,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:28,220 INFO L182 omatonBuilderFactory]: Interpolants [25280#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 25281#(and (= |main_#t~mem21.offset| 0) (<= 8 (select |#length| |main_#t~mem21.base|))), 25245#true, 25246#false, 25247#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 25248#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 25249#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 8 (select |#length| append_~node~0.base))), 25250#(= |old(#length)| |#length|), 25251#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 25252#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 25253#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25254#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25255#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= (store |old(#length)| |append_#t~malloc14.base| (select |#length| |append_#t~malloc14.base|)) |#length|) (= (select |#length| |append_#t~malloc14.base|) 8) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25256#(and (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.base (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= append_~node~0.base append_~pointerToList.base))), 25257#(and (= append_~node~0.offset 0) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.base (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 25258#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (and (= (select |#length| append_~node~0.base) 8) (= append_~node~0.base (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4))))) (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 25259#(and (= (select |#length| |create_data_#t~malloc1.base|) 8) (= |#length| (store |old(#length)| |create_data_#t~malloc1.base| (select |#length| |create_data_#t~malloc1.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25260#(and (or (= create_data_~data~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 25261#(and (or (= create_data_~data~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= (store |old(#memory_$Pointer$.offset)| create_data_~data~0.base (select |#memory_$Pointer$.offset| create_data_~data~0.base)) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| create_data_~data~0.base (select |#memory_$Pointer$.base| create_data_~data~0.base))) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8))), 25262#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |create_data_#res.base| (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 25263#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (store (select |#memory_$Pointer$.offset| append_~node~0.base) append_~node~0.offset |append_#t~ret17.offset|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (= (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) 8) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))) (= |#length| (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= (select (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset))) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~ret17.base| append_~node~0.base)) (= append_~node~0.base append_~pointerToList.base)) (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 25264#(and (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)) (= (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (= (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) 8) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))) (= |#length| (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8))) (= append_~node~0.base append_~pointerToList.base) (and (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) append_~node~0.base) (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)))), 25265#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (= (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)) 8) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))) (= |#length| (store (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|) (select |#length| (@diff (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))) |#length|)))) (or (= |old(#length)| |#length|) (= (select |#length| (@diff |old(#length)| |#length|)) 8)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 25266#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |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| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 25267#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |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| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 25268#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |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| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 25269#(and (or (not (= |main_#t~mem21.offset| 0)) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (and (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))) (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= |main_#t~mem21.offset| 0))), 25270#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 0 |main_#t~mem22.offset|) (<= 8 (select |#length| |main_#t~mem22.base|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 25271#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 25272#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 25273#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 25274#(= freeData_~data.base |freeData_#in~data.base|), 25275#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= freeData_~data.base |freeData_#in~data.base|)), 25276#(= 0 (select |#valid| |freeData_#in~data.base|)), 25277#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 25278#(or (and (not (= |main_#t~mem25.base| 0)) (or (= 0 (select |#valid| |main_#t~mem25.base|)) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))) (not (= |main_#t~mem25.offset| 0))), 25279#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))] [2018-02-02 20:17:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:28,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 20:17:28,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 20:17:28,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1234, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:17:28,221 INFO L87 Difference]: Start difference. First operand 252 states and 279 transitions. Second operand 37 states. [2018-02-02 20:17:28,820 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 80 DAG size of output 77 [2018-02-02 20:17:29,223 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 81 DAG size of output 79 [2018-02-02 20:17:29,567 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 87 DAG size of output 86 [2018-02-02 20:17:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:31,497 INFO L93 Difference]: Finished difference Result 320 states and 365 transitions. [2018-02-02 20:17:31,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 20:17:31,497 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2018-02-02 20:17:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:31,499 INFO L225 Difference]: With dead ends: 320 [2018-02-02 20:17:31,499 INFO L226 Difference]: Without dead ends: 320 [2018-02-02 20:17:31,499 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=436, Invalid=4820, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 20:17:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-02 20:17:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 275. [2018-02-02 20:17:31,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 20:17:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 308 transitions. [2018-02-02 20:17:31,503 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 308 transitions. Word has length 81 [2018-02-02 20:17:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:31,504 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 308 transitions. [2018-02-02 20:17:31,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 20:17:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 308 transitions. [2018-02-02 20:17:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 20:17:31,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:31,505 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:17:31,505 INFO L371 AbstractCegarLoop]: === Iteration 65 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:31,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2132843125, now seen corresponding path program 1 times [2018-02-02 20:17:31,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:31,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 80 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 20:17:31,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:31,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:17:31,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:17:31,553 INFO L182 omatonBuilderFactory]: Interpolants [25952#(= create_data_~counter~0 0), 25953#(<= create_data_~counter~0 1), 25954#(<= create_data_~counter~0 2), 25955#(<= create_data_~counter~0 3), 25956#(<= create_data_~counter~0 4), 25957#(<= create_data_~counter~0 5), 25950#true, 25951#false] [2018-02-02 20:17:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 80 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 20:17:31,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:17:31,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:17:31,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:17:31,554 INFO L87 Difference]: Start difference. First operand 275 states and 308 transitions. Second operand 8 states. [2018-02-02 20:17:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:31,574 INFO L93 Difference]: Finished difference Result 287 states and 320 transitions. [2018-02-02 20:17:31,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:17:31,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-02-02 20:17:31,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:31,576 INFO L225 Difference]: With dead ends: 287 [2018-02-02 20:17:31,576 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 20:17:31,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:17:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 20:17:31,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 282. [2018-02-02 20:17:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 20:17:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 315 transitions. [2018-02-02 20:17:31,578 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 315 transitions. Word has length 95 [2018-02-02 20:17:31,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:31,578 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 315 transitions. [2018-02-02 20:17:31,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:17:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 315 transitions. [2018-02-02 20:17:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:17:31,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:31,579 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:17:31,579 INFO L371 AbstractCegarLoop]: === Iteration 66 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:31,579 INFO L82 PathProgramCache]: Analyzing trace with hash 288516998, now seen corresponding path program 1 times [2018-02-02 20:17:31,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:31,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:32,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:32,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 20:17:32,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:32,198 INFO L182 omatonBuilderFactory]: Interpolants [26527#true, 26528#false, 26529#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 26530#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|))), 26531#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 append_~node~0.base))), 26532#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 26533#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 26534#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 26535#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26536#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26537#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26538#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|)), 26539#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= (select |#valid| append_~node~0.base) 1) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)))), 26540#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26541#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26542#(and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 26543#(and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| create_data_~data~0.base (select |#memory_$Pointer$.base| create_data_~data~0.base)))), 26544#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))), 26545#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|) (+ append_~node~0.offset 4)))), 26546#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) (+ append_~node~0.offset 4)))) (= append_~node~0.base append_~pointerToList.base))), 26547#(or (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4)) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|)), 26548#(or (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 26549#(or (and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))), 26550#(or (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26551#(or (and (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (not (= |main_#t~mem21.offset| 0))) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26552#(or (not (= 0 |main_#t~mem22.base|)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 26553#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 main_~next~0.base)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 26554#(or (not (= 0 main_~next~0.base)) (not (= |main_#t~mem25.offset| 0)) (and (not (= |main_#t~mem25.base| 0)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26555#(or (not (= 0 main_~next~0.base)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 26556#(not (= 0 |main_#t~mem27.base|))] [2018-02-02 20:17:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:32,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:17:32,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:17:32,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:17:32,199 INFO L87 Difference]: Start difference. First operand 282 states and 315 transitions. Second operand 30 states. [2018-02-02 20:17:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:33,337 INFO L93 Difference]: Finished difference Result 314 states and 355 transitions. [2018-02-02 20:17:33,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:17:33,338 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 83 [2018-02-02 20:17:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:33,339 INFO L225 Difference]: With dead ends: 314 [2018-02-02 20:17:33,339 INFO L226 Difference]: Without dead ends: 314 [2018-02-02 20:17:33,339 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=349, Invalid=2957, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:17:33,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-02 20:17:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 282. [2018-02-02 20:17:33,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-02-02 20:17:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 313 transitions. [2018-02-02 20:17:33,341 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 313 transitions. Word has length 83 [2018-02-02 20:17:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:33,342 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 313 transitions. [2018-02-02 20:17:33,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:17:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 313 transitions. [2018-02-02 20:17:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:17:33,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:33,342 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:17:33,342 INFO L371 AbstractCegarLoop]: === Iteration 67 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash -612890950, now seen corresponding path program 1 times [2018-02-02 20:17:33,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:33,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:34,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:34,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 20:17:34,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:34,445 INFO L182 omatonBuilderFactory]: Interpolants [27210#true, 27211#false, 27212#(= (select |#valid| |main_~#list~0.base|) 1), 27213#(= |#valid| |old(#valid)|), 27214#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 27215#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 27216#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= |append_#in~pointerToList.base| append_~pointerToList.base) (= append_~node~0.offset 0))) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base)))), 27217#(and (= 0 |create_data_#res.base|) (= 0 |create_data_#res.offset|)), 27218#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= |append_#in~pointerToList.base| append_~pointerToList.base) (= 0 |append_#t~ret17.offset|) (= append_~node~0.offset 0) (= 0 |append_#t~ret17.base|)))), 27219#(and (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= 0 append_~node~0.offset) (= |append_#in~pointerToList.base| append_~pointerToList.base) (= (select |#valid| append_~node~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) 0))) (= append_~pointerToList.base append_~node~0.base))), 27220#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 1) (not (= |append_#in~pointerToList.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0)))), 27221#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 27222#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27223#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27224#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27225#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (= append_~node~0.offset 0) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 27226#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |append_#t~mem16.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (= append_~node~0.offset 0) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 27227#(and (or (= append_~pointerToList.base append_~node~0.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| append_~node~0.base)) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= append_~node~0.offset 0) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|)))), 27228#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27229#(and (or (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) |append_#in~pointerToList.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) |append_#in~pointerToList.base|) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 27230#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 27231#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_#t~mem21.offset| 0)), 27232#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) 0)) (not (= |main_~#list~0.base| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) 0)))), 27233#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0)))), 27234#(or (and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0)))), 27235#(or (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27236#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))), 27237#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))), 27238#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27239#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 27240#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 27241#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 27242#(and (= 0 |freeData_#in~data.offset|) (= 0 |freeData_#in~data.base|)), 27243#(and (= 0 freeData_~data.offset) (= freeData_~data.base 0))] [2018-02-02 20:17:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:34,445 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 20:17:34,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 20:17:34,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1038, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:17:34,446 INFO L87 Difference]: Start difference. First operand 282 states and 313 transitions. Second operand 34 states. [2018-02-02 20:17:35,420 WARN L146 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 111 DAG size of output 110 [2018-02-02 20:17:37,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:37,591 INFO L93 Difference]: Finished difference Result 333 states and 374 transitions. [2018-02-02 20:17:37,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 20:17:37,591 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 78 [2018-02-02 20:17:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:37,592 INFO L225 Difference]: With dead ends: 333 [2018-02-02 20:17:37,592 INFO L226 Difference]: Without dead ends: 333 [2018-02-02 20:17:37,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=366, Invalid=4326, Unknown=0, NotChecked=0, Total=4692 [2018-02-02 20:17:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-02 20:17:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 313. [2018-02-02 20:17:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-02-02 20:17:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 349 transitions. [2018-02-02 20:17:37,595 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 349 transitions. Word has length 78 [2018-02-02 20:17:37,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:37,595 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 349 transitions. [2018-02-02 20:17:37,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 20:17:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 349 transitions. [2018-02-02 20:17:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:17:37,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:37,596 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02 20:17:37,596 INFO L371 AbstractCegarLoop]: === Iteration 68 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash 384693748, now seen corresponding path program 1 times [2018-02-02 20:17:37,596 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:37,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:38,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:38,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 20:17:38,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:38,354 INFO L182 omatonBuilderFactory]: Interpolants [27968#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27969#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 27970#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 27971#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= append_~node~0.offset 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= append_~node~0.base append_~pointerToList.base)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 27972#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= append_~node~0.base append_~pointerToList.base))), 27973#(= (store |old(#memory_$Pointer$.offset)| create_data_~data~0.base (select |#memory_$Pointer$.offset| create_data_~data~0.base)) |#memory_$Pointer$.offset|), 27974#(and (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 27975#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (or (= (select (store (select |#memory_$Pointer$.offset| append_~node~0.base) append_~node~0.offset |append_#t~ret17.offset|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= |append_#t~ret17.base| append_~node~0.base))) (= append_~node~0.base append_~pointerToList.base))), 27976#(and (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (or (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) append_~node~0.base) (= (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= append_~node~0.base append_~pointerToList.base)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 27977#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 27978#(or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 27979#(and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27980#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27981#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (or (not (= |main_#t~mem21.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) (and (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= |main_#t~mem21.offset| 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27982#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= 0 |main_#t~mem22.offset|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27983#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 main_~next~0.offset) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27984#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= 0 main_~next~0.offset) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 27985#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 main_~next~0.offset) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27986#(= freeData_~data.base |freeData_#in~data.base|), 27987#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= freeData_~data.base |freeData_#in~data.base|)), 27988#(= 0 (select |#valid| |freeData_#in~data.base|)), 27989#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27990#(and (or (= 0 (select |#valid| |main_#t~mem25.base|)) (= 0 main_~next~0.offset) (not (= |main_#t~mem25.offset| 0)) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0)))), 27991#(or (= 0 main_~next~0.offset) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27992#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 27993#(and (= |main_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem21.offset| 0)), 27994#(and (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 27995#(and (<= 0 |main_#t~mem23.offset|) (<= (+ |main_#t~mem23.offset| 8) (select |#length| |main_#t~mem23.base|))), 27960#true, 27961#false, 27962#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 27963#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 27964#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 27965#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 27966#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 27967#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)] [2018-02-02 20:17:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:38,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 20:17:38,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 20:17:38,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1164, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:17:38,355 INFO L87 Difference]: Start difference. First operand 313 states and 349 transitions. Second operand 36 states. [2018-02-02 20:17:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:40,506 INFO L93 Difference]: Finished difference Result 336 states and 374 transitions. [2018-02-02 20:17:40,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 20:17:40,506 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 84 [2018-02-02 20:17:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:40,507 INFO L225 Difference]: With dead ends: 336 [2018-02-02 20:17:40,507 INFO L226 Difference]: Without dead ends: 336 [2018-02-02 20:17:40,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=574, Invalid=5588, Unknown=0, NotChecked=0, Total=6162 [2018-02-02 20:17:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-02-02 20:17:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 293. [2018-02-02 20:17:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-02 20:17:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 328 transitions. [2018-02-02 20:17:40,510 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 328 transitions. Word has length 84 [2018-02-02 20:17:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:40,511 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 328 transitions. [2018-02-02 20:17:40,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 20:17:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 328 transitions. [2018-02-02 20:17:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 20:17:40,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:40,511 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02 20:17:40,512 INFO L371 AbstractCegarLoop]: === Iteration 69 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:40,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1253326230, now seen corresponding path program 1 times [2018-02-02 20:17:40,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:40,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:41,370 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:41,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 20:17:41,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:41,370 INFO L182 omatonBuilderFactory]: Interpolants [28736#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 |main_#t~mem22.offset|) (<= 8 (select |#length| |main_#t~mem22.base|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 28737#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 28738#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (not (= |main_#t~mem25.offset| 0)) (and (not (= |main_#t~mem25.base| 0)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 28739#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 28740#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 28741#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 28742#(and (= |main_#t~mem21.offset| 0) (<= 8 (select |#length| |main_#t~mem21.base|))), 28713#true, 28714#false, 28715#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 28716#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= 8 (select |#length| |append_#t~malloc14.base|))), 28717#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= 8 (select |#length| append_~node~0.base))), 28718#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset) (= (select |#valid| append_~node~0.base) 1) (= 8 (select |#length| append_~node~0.base))), 28719#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 28720#(and (= |#length| (store |old(#length)| |create_data_#t~malloc1.base| (select |#length| |create_data_#t~malloc1.base|))) (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|))), 28721#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 28722#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))), 28723#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 28724#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28725#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28726#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= (store |old(#length)| |append_#t~malloc14.base| (select |#length| |append_#t~malloc14.base|)) |#length|) (= 0 (select |old(#valid)| |append_#t~malloc14.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28727#(and (= 0 append_~node~0.offset) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 28728#(and (= 0 append_~node~0.offset) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |append_#t~mem16.base| (select (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= append_~node~0.base append_~pointerToList.base))), 28729#(and (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)))) (= 0 append_~node~0.offset) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 28730#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 28731#(or (and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|)), 28732#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 28733#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 28734#(or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 28735#(and (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= |main_#t~mem21.offset| 0)) (or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (not (= |main_#t~mem21.offset| 0)) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))))] [2018-02-02 20:17:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:41,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 20:17:41,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 20:17:41,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:17:41,371 INFO L87 Difference]: Start difference. First operand 293 states and 328 transitions. Second operand 30 states. [2018-02-02 20:17:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:43,323 INFO L93 Difference]: Finished difference Result 351 states and 394 transitions. [2018-02-02 20:17:43,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 20:17:43,323 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 78 [2018-02-02 20:17:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:43,324 INFO L225 Difference]: With dead ends: 351 [2018-02-02 20:17:43,324 INFO L226 Difference]: Without dead ends: 351 [2018-02-02 20:17:43,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=309, Invalid=2771, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:17:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-02-02 20:17:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 291. [2018-02-02 20:17:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 20:17:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 323 transitions. [2018-02-02 20:17:43,328 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 323 transitions. Word has length 78 [2018-02-02 20:17:43,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:43,328 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 323 transitions. [2018-02-02 20:17:43,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 20:17:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 323 transitions. [2018-02-02 20:17:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 20:17:43,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:43,328 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02 20:17:43,328 INFO L371 AbstractCegarLoop]: === Iteration 70 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:43,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1653237985, now seen corresponding path program 1 times [2018-02-02 20:17:43,329 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:43,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:44,994 WARN L146 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 89 DAG size of output 82 [2018-02-02 20:17:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:46,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:46,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-02-02 20:17:46,353 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:46,354 INFO L182 omatonBuilderFactory]: Interpolants [29440#(= (select |#valid| |main_~#list~0.base|) 1), 29441#(= |#valid| |old(#valid)|), 29442#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|)), 29443#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= 0 (select |old(#valid)| |append_#t~malloc14.base|))), 29444#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= append_~pointerToList.base append_~node~0.base) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~node~0.offset 0))) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base)))), 29445#(and (= 0 |create_data_#res.base|) (= 0 |create_data_#res.offset|)), 29446#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (or (= append_~pointerToList.base append_~node~0.base) (and (= 0 (select |old(#valid)| append_~node~0.base)) (= 0 |append_#t~ret17.offset|) (= append_~node~0.offset 0) (= 0 |append_#t~ret17.base|)))), 29447#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= append_~pointerToList.base append_~node~0.base) (and (= 0 append_~node~0.offset) (= 0 (select |old(#valid)| append_~node~0.base)) (= 0 (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) 0)))) (or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (not (= append_~pointerToList.base append_~node~0.base))) (= (select |#valid| append_~node~0.base) 1)), 29448#(or (= 0 (select |old(#valid)| |append_#in~pointerToList.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 29449#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 29450#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29451#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29452#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~malloc14.offset| 0) (= |#valid| (store |old(#valid)| |append_#t~malloc14.base| (select |#valid| |append_#t~malloc14.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29453#(and (= 0 append_~node~0.offset) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))))), 29454#(and (= 0 append_~node~0.offset) (or (= append_~node~0.base append_~pointerToList.base) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~pointerToList.base) |append_#in~pointerToList.offset|) |append_#t~mem16.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 29455#(and (= 0 append_~node~0.offset) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 4))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= append_~node~0.base append_~pointerToList.base))), 29456#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29457#(and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 29458#(and (= (store |old(#memory_$Pointer$.offset)| create_data_~data~0.base (select |#memory_$Pointer$.offset| create_data_~data~0.base)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| create_data_~data~0.base (select |#memory_$Pointer$.base| create_data_~data~0.base)))), 29459#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= |create_data_#res.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 29460#(and (= 0 append_~node~0.offset) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (= (select (store (select |#memory_$Pointer$.offset| append_~node~0.base) append_~node~0.offset |append_#t~ret17.offset|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|)))) (= (select (store (select |#memory_$Pointer$.base| append_~node~0.base) append_~node~0.offset |append_#t~ret17.base|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| append_~pointerToList.base) append_~pointerToList.offset)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|))))) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~ret17.base| append_~node~0.base)) (= append_~node~0.base append_~pointerToList.base)) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base)))), 29461#(and (= 0 append_~node~0.offset) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (= append_~node~0.base append_~pointerToList.base) (and (= (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) 0) append_~node~0.base) (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (or (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|)))) (= (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (select (select (store |#memory_$Pointer$.base| append_~pointerToList.base (store (select |#memory_$Pointer$.base| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.base)) append_~node~0.base) (+ append_~node~0.offset 4))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|))))))), 29462#(or (and (or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) |append_#in~pointerToList.base|) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~pointerToList.base|) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~pointerToList.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)) (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (= (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) |append_#in~pointerToList.base|)) (or (= 0 (select |old(#valid)| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (= (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) |append_#in~pointerToList.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (store (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)) (= (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) |append_#in~pointerToList.base|) (= 0 (select |old(#valid)| (@diff (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|))))) (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 0) (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 29463#(or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 29464#(and (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 29465#(and (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))), 29466#(and (or (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4)))) (and (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))))) (not (= |main_#t~mem21.offset| 0))) (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= |main_#t~mem21.offset| 0))), 29467#(or (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem22.base|) 0)) (not (= |main_~#list~0.base| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem22.base|) 0))) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem22.base|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 29468#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) main_~next~0.base) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 29469#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) main_~next~0.base) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 29470#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= |main_#t~mem24.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) main_~next~0.base) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 29471#(= freeData_~data.base |freeData_#in~data.base|), 29472#(and (or (not (= freeData_~data.base 0)) (not (= 0 freeData_~data.offset))) (= freeData_~data.base |freeData_#in~data.base|)), 29473#(= 0 (select |#valid| |freeData_#in~data.base|)), 29474#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) main_~next~0.base) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 29475#(and (or (not (= 0 |main_#t~mem25.offset|)) (not (= |main_#t~mem25.base| 0))) (or (= 0 (select |#valid| |main_#t~mem25.base|)) (not (= 0 |main_#t~mem25.offset|)) (and (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) main_~next~0.base) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (and (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 29476#(or (and (= 0 main_~next~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 0)) (= 0 (select (select (store |#memory_$Pointer$.base| |main_~#list~0.base| (store (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.base)) main_~next~0.base) 0))) (and (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) main_~next~0.base) (not (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 29477#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))) (not (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 29478#(or (not (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)))), 29479#(or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 29480#(or (not (= 1 (select |#valid| |main_#t~mem21.base|))) (and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 29481#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 29482#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem23.base|) |main_#t~mem23.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem23.base|) |main_#t~mem23.offset|))), 29483#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 29484#(and (= 0 |freeData_#in~data.offset|) (= 0 |freeData_#in~data.base|)), 29485#(and (= 0 freeData_~data.offset) (= freeData_~data.base 0)), 29438#true, 29439#false] [2018-02-02 20:17:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:46,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 20:17:46,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 20:17:46,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=2137, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:17:46,355 INFO L87 Difference]: Start difference. First operand 291 states and 323 transitions. Second operand 48 states. [2018-02-02 20:17:48,027 WARN L143 SmtUtils]: Spent 234ms on a formula simplification that was a NOOP. DAG size: 132 [2018-02-02 20:17:48,778 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 93 DAG size of output 84 [2018-02-02 20:17:48,963 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 79 DAG size of output 71 [2018-02-02 20:17:49,309 WARN L143 SmtUtils]: Spent 190ms on a formula simplification that was a NOOP. DAG size: 104 [2018-02-02 20:17:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:53,637 INFO L93 Difference]: Finished difference Result 334 states and 370 transitions. [2018-02-02 20:17:53,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-02 20:17:53,637 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 88 [2018-02-02 20:17:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:53,638 INFO L225 Difference]: With dead ends: 334 [2018-02-02 20:17:53,638 INFO L226 Difference]: Without dead ends: 334 [2018-02-02 20:17:53,639 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1998 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=529, Invalid=8783, Unknown=0, NotChecked=0, Total=9312 [2018-02-02 20:17:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-02 20:17:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 302. [2018-02-02 20:17:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-02-02 20:17:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 336 transitions. [2018-02-02 20:17:53,643 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 336 transitions. Word has length 88 [2018-02-02 20:17:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:53,643 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 336 transitions. [2018-02-02 20:17:53,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 20:17:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 336 transitions. [2018-02-02 20:17:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:17:53,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:53,644 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:17:53,644 INFO L371 AbstractCegarLoop]: === Iteration 71 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:53,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1109930390, now seen corresponding path program 1 times [2018-02-02 20:17:53,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:53,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:54,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:54,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:17:54,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:54,065 INFO L182 omatonBuilderFactory]: Interpolants [30240#(or (= 0 main_~next~0.offset) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 30241#(or (= 0 (select |#valid| |main_~#list~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 30242#(= |#valid| |old(#valid)|), 30243#(= 0 |main_#t~mem25.offset|), 30220#true, 30221#false, 30222#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 30223#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 30224#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 30225#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 30226#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 30227#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 30228#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30229#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (not (= 0 |append_#t~malloc14.base|)) (= 0 |append_#t~malloc14.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30230#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30231#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= append_~node~0.offset 0) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 30232#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (or (not (= 0 append_~node~0.base)) (not (= append_~pointerToList.base append_~node~0.base))) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 30233#(and (= append_~node~0.offset 0) (or (not (= append_~pointerToList.base append_~node~0.base)) (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (not (= 0 append_~node~0.base)) (= append_~node~0.base |append_#in~pointerToList.base|))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= append_~pointerToList.base append_~node~0.base))), 30234#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (and (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))))), 30235#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 30236#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) (= |main_#t~mem21.offset| 0))), 30237#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 |main_#t~mem22.offset|)), 30238#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset)), 30239#(or (and (not (= 0 |main_#t~mem25.base|)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset))] [2018-02-02 20:17:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:54,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:17:54,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:17:54,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:17:54,066 INFO L87 Difference]: Start difference. First operand 302 states and 336 transitions. Second operand 24 states. [2018-02-02 20:17:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:54,940 INFO L93 Difference]: Finished difference Result 361 states and 400 transitions. [2018-02-02 20:17:54,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:17:54,941 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-02 20:17:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:54,942 INFO L225 Difference]: With dead ends: 361 [2018-02-02 20:17:54,942 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 20:17:54,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=2047, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:17:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 20:17:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 346. [2018-02-02 20:17:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-02-02 20:17:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 387 transitions. [2018-02-02 20:17:54,945 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 387 transitions. Word has length 82 [2018-02-02 20:17:54,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:54,945 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 387 transitions. [2018-02-02 20:17:54,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:17:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 387 transitions. [2018-02-02 20:17:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 20:17:54,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:54,945 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 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] [2018-02-02 20:17:54,946 INFO L371 AbstractCegarLoop]: === Iteration 72 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:54,946 INFO L82 PathProgramCache]: Analyzing trace with hash -863508538, now seen corresponding path program 3 times [2018-02-02 20:17:54,946 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:54,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 3 proven. 117 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:17:55,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:55,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:17:55,012 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:17:55,012 INFO L182 omatonBuilderFactory]: Interpolants [31008#(<= create_data_~counter~0 3), 31009#(<= create_data_~counter~0 4), 31010#(<= create_data_~counter~0 5), 31011#(<= create_data_~counter~0 6), 31003#true, 31004#false, 31005#(= create_data_~counter~0 0), 31006#(<= create_data_~counter~0 1), 31007#(<= create_data_~counter~0 2)] [2018-02-02 20:17:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 3 proven. 117 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:17:55,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:17:55,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:17:55,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:17:55,013 INFO L87 Difference]: Start difference. First operand 346 states and 387 transitions. Second operand 9 states. [2018-02-02 20:17:55,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:55,037 INFO L93 Difference]: Finished difference Result 358 states and 399 transitions. [2018-02-02 20:17:55,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:17:55,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-02-02 20:17:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:55,038 INFO L225 Difference]: With dead ends: 358 [2018-02-02 20:17:55,038 INFO L226 Difference]: Without dead ends: 358 [2018-02-02 20:17:55,038 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:17:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-02-02 20:17:55,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2018-02-02 20:17:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-02-02 20:17:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 394 transitions. [2018-02-02 20:17:55,041 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 394 transitions. Word has length 95 [2018-02-02 20:17:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:55,041 INFO L432 AbstractCegarLoop]: Abstraction has 353 states and 394 transitions. [2018-02-02 20:17:55,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:17:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 394 transitions. [2018-02-02 20:17:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:17:55,041 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:55,041 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:17:55,041 INFO L371 AbstractCegarLoop]: === Iteration 73 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:55,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1491213077, now seen corresponding path program 1 times [2018-02-02 20:17:55,042 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:55,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:17:55,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:55,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:17:55,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 20:17:55,156 INFO L182 omatonBuilderFactory]: Interpolants [31728#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_#t~mem23.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem23.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) 0) 0)))), 31729#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (not (= |main_#t~mem24.base| 0)) (not (= (select |#memory_$Pointer$.base| |main_~#list~0.base|) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))))), 31730#(= freeData_~data.base |freeData_#in~data.base|), 31731#(= 0 |freeData_#in~data.base|), 31732#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select |#memory_$Pointer$.base| |main_~#list~0.base|) (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))))), 31733#(or (not (= 0 |main_#t~mem25.offset|)) (and (not (= |main_#t~mem25.base| 0)) (not (= |main_~#list~0.base| |main_#t~mem25.base|)) (= 1 (select |#valid| |main_~#list~0.base|)))), 31734#(= 1 (select |#valid| |main_~#list~0.base|)), 31723#true, 31724#false, 31725#(= |main_~#list~0.offset| 0), 31726#(and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) 0))), 31727#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) 0) 0))))] [2018-02-02 20:17:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:17:55,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:17:55,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:17:55,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:17:55,156 INFO L87 Difference]: Start difference. First operand 353 states and 394 transitions. Second operand 12 states. [2018-02-02 20:17:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:17:55,539 INFO L93 Difference]: Finished difference Result 356 states and 396 transitions. [2018-02-02 20:17:55,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:17:55,539 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 84 [2018-02-02 20:17:55,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:17:55,540 INFO L225 Difference]: With dead ends: 356 [2018-02-02 20:17:55,541 INFO L226 Difference]: Without dead ends: 356 [2018-02-02 20:17:55,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:17:55,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-02-02 20:17:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 350. [2018-02-02 20:17:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-02 20:17:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 391 transitions. [2018-02-02 20:17:55,545 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 391 transitions. Word has length 84 [2018-02-02 20:17:55,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:17:55,545 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 391 transitions. [2018-02-02 20:17:55,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:17:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 391 transitions. [2018-02-02 20:17:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 20:17:55,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:17:55,546 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-02 20:17:55,547 INFO L371 AbstractCegarLoop]: === Iteration 74 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 20:17:55,547 INFO L82 PathProgramCache]: Analyzing trace with hash -754006767, now seen corresponding path program 1 times [2018-02-02 20:17:55,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:17:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:17:55,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:17:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:56,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:17:56,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 20:17:56,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:17:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:56,134 INFO L182 omatonBuilderFactory]: Interpolants [32467#true, 32468#false, 32469#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|)), 32470#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|)), 32471#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 append_~node~0.offset)), 32472#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)), 32473#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 32474#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 32475#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32476#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= 0 |append_#t~malloc14.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32477#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32478#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= |append_#t~mem16.offset| (select (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset)) (= append_~node~0.offset 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32479#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= append_~node~0.offset 0) (= (select |#valid| append_~node~0.base) 1) (= (select (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 32480#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32481#(and (= 0 (select |old(#valid)| |create_data_#t~malloc1.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32482#(and (= 0 (select |old(#valid)| create_data_~data~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 32483#(and (= (store |old(#memory_$Pointer$.offset)| create_data_~data~0.base (select |#memory_$Pointer$.offset| create_data_~data~0.base)) |#memory_$Pointer$.offset|) (= 0 (select |old(#valid)| create_data_~data~0.base))), 32484#(and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)), 32485#(and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (store (select |#memory_$Pointer$.offset| append_~node~0.base) append_~node~0.offset |append_#t~ret17.offset|) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) (= append_~node~0.offset 0)), 32486#(and (= append_~node~0.offset 0) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~node~0.base |append_#in~pointerToList.base|)) (not (= append_~node~0.base append_~pointerToList.base))) (or (and (= append_~pointerToList.offset |append_#in~pointerToList.offset|) (= append_~pointerToList.base |append_#in~pointerToList.base|) (= (select (select (store |#memory_$Pointer$.offset| append_~pointerToList.base (store (select |#memory_$Pointer$.offset| append_~pointerToList.base) append_~pointerToList.offset append_~node~0.offset)) append_~node~0.base) (+ append_~node~0.offset 4)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))) (= append_~node~0.base append_~pointerToList.base))), 32487#(or (= (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|) |append_#in~pointerToList.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|)) 4) (select (select |old(#memory_$Pointer$.offset)| |append_#in~pointerToList.base|) |append_#in~pointerToList.offset|))), 32488#(or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 32489#(or (and (= |main_#t~mem27.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem27.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))), 32490#(or (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 32491#(and (or (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem21.offset|) (= |main_#t~mem21.offset| 0)) (or (not (= |main_#t~mem21.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (+ |main_#t~mem21.offset| 4))) (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 32492#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= 0 |main_#t~mem22.offset|)), 32493#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))), 32494#(or (= 0 main_~next~0.offset) (not (= |main_#t~mem25.offset| 0)) (and (not (= |main_#t~mem25.base| 0)) (= |main_#t~mem25.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 32495#(or (= 0 main_~next~0.offset) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 32496#(or (= 0 (select |#valid| |main_~#list~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 32497#(= |#valid| |old(#valid)|), 32498#(= 0 |main_#t~mem25.offset|)] [2018-02-02 20:17:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:17:56,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:17:56,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:17:56,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:17:56,135 INFO L87 Difference]: Start difference. First operand 350 states and 391 transitions. Second operand 32 states. Received shutdown request... [2018-02-02 20:17:56,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:17:56,171 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:17:56,177 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:17:56,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:17:56 BoogieIcfgContainer [2018-02-02 20:17:56,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:17:56,178 INFO L168 Benchmark]: Toolchain (without parser) took 73766.85 ms. Allocated memory was 400.6 MB in the beginning and 1.4 GB in the end (delta: 963.1 MB). Free memory was 357.2 MB in the beginning and 853.3 MB in the end (delta: -496.0 MB). Peak memory consumption was 467.1 MB. Max. memory is 5.3 GB. [2018-02-02 20:17:56,179 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 400.6 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:17:56,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.42 ms. Allocated memory is still 400.6 MB. Free memory was 357.2 MB in the beginning and 346.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:17:56,180 INFO L168 Benchmark]: Boogie Preprocessor took 27.11 ms. Allocated memory is still 400.6 MB. Free memory was 346.7 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:17:56,180 INFO L168 Benchmark]: RCFGBuilder took 364.65 ms. Allocated memory is still 400.6 MB. Free memory was 344.0 MB in the beginning and 310.8 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:17:56,180 INFO L168 Benchmark]: TraceAbstraction took 73201.46 ms. Allocated memory was 400.6 MB in the beginning and 1.4 GB in the end (delta: 963.1 MB). Free memory was 310.8 MB in the beginning and 853.3 MB in the end (delta: -542.4 MB). Peak memory consumption was 420.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:17:56,182 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.12 ms. Allocated memory is still 400.6 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 170.42 ms. Allocated memory is still 400.6 MB. Free memory was 357.2 MB in the beginning and 346.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 27.11 ms. Allocated memory is still 400.6 MB. Free memory was 346.7 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 364.65 ms. Allocated memory is still 400.6 MB. Free memory was 344.0 MB in the beginning and 310.8 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 73201.46 ms. Allocated memory was 400.6 MB in the beginning and 1.4 GB in the end (delta: 963.1 MB). Free memory was 310.8 MB in the beginning and 853.3 MB in the end (delta: -542.4 MB). Peak memory consumption was 420.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 576). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (350states) and interpolant automaton (currently 5 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (7 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 121 locations, 45 error locations. TIMEOUT Result, 73.1s OverallTime, 74 OverallIterations, 7 TraceHistogramMax, 48.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6200 SDtfs, 6455 SDslu, 34966 SDs, 0 SdLazy, 44248 SolverSat, 1760 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2062 GetRequests, 181 SyntacticMatches, 57 SemanticMatches, 1824 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18786 ImplicationChecksByTransitivity, 43.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred in iteration=72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 295/869 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, 73 MinimizatonAttempts, 1108 StatesRemovedByMinimization, 67 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 3649 NumberOfCodeBlocks, 3649 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 3575 ConstructedInterpolants, 0 QuantifiedInterpolants, 3429845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 74 InterpolantComputations, 43 PerfectInterpolantSequences, 295/869 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-17-56-189.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-17-56-189.csv Completed graceful shutdown