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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:05:19,522 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:05:19,524 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:05:19,536 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:05:19,536 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:05:19,537 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:05:19,538 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:05:19,539 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:05:19,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:05:19,541 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:05:19,542 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:05:19,542 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:05:19,543 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:05:19,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:05:19,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:05:19,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:05:19,547 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:05:19,549 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:05:19,550 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:05:19,551 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:05:19,553 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:05:19,553 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:05:19,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:05:19,554 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:05:19,554 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:05:19,555 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:05:19,555 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:05:19,556 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:05:19,556 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:05:19,556 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:05:19,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:05:19,557 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:05:19,565 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:05:19,566 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:05:19,567 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:05:19,567 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:05:19,567 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:05:19,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:05:19,567 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:05:19,567 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:05:19,567 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:05:19,567 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:05:19,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:05:19,568 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:05:19,568 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:05:19,568 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:05:19,568 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:05:19,568 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:05:19,568 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:05:19,568 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:05:19,569 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:05:19,569 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:05:19,569 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:05:19,569 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:05:19,569 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:05:19,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:05:19,610 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:05:19,613 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:05:19,614 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:05:19,615 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:05:19,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_true-valid-memsafety.i [2018-02-02 10:05:19,754 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:05:19,755 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:05:19,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:05:19,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:05:19,762 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:05:19,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:05:19" (1/1) ... [2018-02-02 10:05:19,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a9d1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:19, skipping insertion in model container [2018-02-02 10:05:19,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:05:19" (1/1) ... [2018-02-02 10:05:19,779 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:05:19,808 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:05:19,922 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:05:19,937 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:05:19,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:19 WrapperNode [2018-02-02 10:05:19,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:05:19,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:05:19,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:05:19,944 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:05:19,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:19" (1/1) ... [2018-02-02 10:05:19,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:19" (1/1) ... [2018-02-02 10:05:19,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:19" (1/1) ... [2018-02-02 10:05:19,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:19" (1/1) ... [2018-02-02 10:05:19,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:19" (1/1) ... [2018-02-02 10:05:19,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:19" (1/1) ... [2018-02-02 10:05:19,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:19" (1/1) ... [2018-02-02 10:05:19,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:05:19,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:05:19,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:05:19,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:05:19,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:19" (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 10:05:20,012 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:05:20,013 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:05:20,013 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 10:05:20,013 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:05:20,013 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:05:20,013 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:05:20,013 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:05:20,013 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:05:20,013 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:05:20,013 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:05:20,014 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:05:20,014 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:05:20,014 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-02-02 10:05:20,014 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:05:20,014 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 10:05:20,014 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:05:20,014 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:05:20,014 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:05:20,361 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:05:20,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:05:20 BoogieIcfgContainer [2018-02-02 10:05:20,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:05:20,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:05:20,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:05:20,365 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:05:20,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:05:19" (1/3) ... [2018-02-02 10:05:20,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecccf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:05:20, skipping insertion in model container [2018-02-02 10:05:20,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:05:19" (2/3) ... [2018-02-02 10:05:20,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecccf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:05:20, skipping insertion in model container [2018-02-02 10:05:20,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:05:20" (3/3) ... [2018-02-02 10:05:20,369 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_true-valid-memsafety.i [2018-02-02 10:05:20,377 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:05:20,384 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-02 10:05:20,416 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:05:20,416 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:05:20,417 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:05:20,417 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:05:20,417 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:05:20,417 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:05:20,417 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:05:20,417 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:05:20,418 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:05:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2018-02-02 10:05:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:05:20,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:20,438 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:20,438 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:20,441 INFO L82 PathProgramCache]: Analyzing trace with hash -683315734, now seen corresponding path program 1 times [2018-02-02 10:05:20,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:20,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:20,559 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 10:05:20,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:20,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:20,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:20,563 INFO L182 omatonBuilderFactory]: Interpolants [134#true, 135#false, 136#(= 1 (select |#valid| |main_#t~malloc15.base|)), 137#(= 1 (select |#valid| main_~list~0.base))] [2018-02-02 10:05:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:20,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:20,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:20,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:20,576 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2018-02-02 10:05:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:20,861 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2018-02-02 10:05:20,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:05:20,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:05:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:20,871 INFO L225 Difference]: With dead ends: 161 [2018-02-02 10:05:20,871 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:05:20,872 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 10:05:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:05:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2018-02-02 10:05:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:05:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-02-02 10:05:20,901 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 8 [2018-02-02 10:05:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:20,901 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-02-02 10:05:20,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-02-02 10:05:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:05:20,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:20,902 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:20,902 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:20,902 INFO L82 PathProgramCache]: Analyzing trace with hash -683315733, now seen corresponding path program 1 times [2018-02-02 10:05:20,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:20,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:20,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:20,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:20,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:20,947 INFO L182 omatonBuilderFactory]: Interpolants [427#true, 428#false, 429#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|)), 430#(and (= main_~list~0.offset 0) (= (select |#length| main_~list~0.base) 8))] [2018-02-02 10:05:20,947 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 10:05:20,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:20,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:20,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:20,948 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 4 states. [2018-02-02 10:05:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:21,040 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-02-02 10:05:21,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:21,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:05:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:21,042 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:05:21,042 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:05:21,043 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 10:05:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:05:21,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-02-02 10:05:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:05:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-02-02 10:05:21,049 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 8 [2018-02-02 10:05:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:21,050 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-02-02 10:05:21,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-02-02 10:05:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 10:05:21,050 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:21,050 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:21,051 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912018, now seen corresponding path program 1 times [2018-02-02 10:05:21,052 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:21,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:21,087 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 10:05:21,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:21,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:21,088 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:21,088 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 10:05:21,088 INFO L182 omatonBuilderFactory]: Interpolants [683#true, 684#false, 685#(= 1 (select |#valid| |main_#t~malloc18.base|)), 686#(= 1 (select |#valid| main_~list2~0.base))] [2018-02-02 10:05:21,089 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 10:05:21,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:21,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:21,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:21,089 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 4 states. [2018-02-02 10:05:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:21,195 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-02-02 10:05:21,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:05:21,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 10:05:21,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:21,196 INFO L225 Difference]: With dead ends: 136 [2018-02-02 10:05:21,196 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 10:05:21,196 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 10:05:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 10:05:21,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2018-02-02 10:05:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:05:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-02-02 10:05:21,201 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 12 [2018-02-02 10:05:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:21,201 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-02-02 10:05:21,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-02-02 10:05:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 10:05:21,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:21,202 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:21,202 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:21,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1180912017, now seen corresponding path program 1 times [2018-02-02 10:05:21,203 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:21,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:21,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 10:05:21,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:21,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:21,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:21,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 10:05:21,249 INFO L182 omatonBuilderFactory]: Interpolants [951#true, 952#false, 953#(and (= 0 |main_#t~malloc18.offset|) (= 8 (select |#length| |main_#t~malloc18.base|))), 954#(and (= (select |#length| main_~list2~0.base) 8) (= main_~list2~0.offset 0))] [2018-02-02 10:05:21,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 10:05:21,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:21,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:21,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:21,250 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 4 states. [2018-02-02 10:05:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:21,318 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-02 10:05:21,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:21,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-02-02 10:05:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:21,320 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:05:21,320 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:05:21,320 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 10:05:21,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:05:21,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-02-02 10:05:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:05:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-02 10:05:21,325 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 12 [2018-02-02 10:05:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:21,326 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-02 10:05:21,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-02 10:05:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:05:21,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:21,327 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:21,327 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash -424566030, now seen corresponding path program 1 times [2018-02-02 10:05:21,328 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:21,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:21,369 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 10:05:21,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:21,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:21,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:21,370 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 10:05:21,370 INFO L182 omatonBuilderFactory]: Interpolants [1207#true, 1208#false, 1209#(= 1 (select |#valid| |append_#t~malloc0.base|)), 1210#(= 1 (select |#valid| append_~node~0.base))] [2018-02-02 10:05:21,370 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 10:05:21,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:21,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:21,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:21,371 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 4 states. [2018-02-02 10:05:21,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:21,462 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 10:05:21,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:21,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 10:05:21,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:21,463 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:05:21,463 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:05:21,463 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 10:05:21,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:05:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 10:05:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:05:21,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-02 10:05:21,467 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 20 [2018-02-02 10:05:21,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:21,467 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-02 10:05:21,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-02 10:05:21,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:05:21,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:21,468 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:21,468 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:21,468 INFO L82 PathProgramCache]: Analyzing trace with hash -424566029, now seen corresponding path program 1 times [2018-02-02 10:05:21,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:21,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:21,528 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 10:05:21,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:21,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:21,528 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:21,528 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 10:05:21,528 INFO L182 omatonBuilderFactory]: Interpolants [1451#true, 1452#false, 1453#(and (= 9 (select |#length| |append_#t~malloc0.base|)) (= 0 |append_#t~malloc0.offset|)), 1454#(and (= append_~node~0.offset 0) (= (select |#length| append_~node~0.base) 9))] [2018-02-02 10:05:21,528 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 10:05:21,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:21,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:21,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:21,529 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-02-02 10:05:21,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:21,598 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-02-02 10:05:21,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:21,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 10:05:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:21,599 INFO L225 Difference]: With dead ends: 114 [2018-02-02 10:05:21,599 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 10:05:21,599 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 10:05:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 10:05:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 10:05:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:05:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-02-02 10:05:21,602 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2018-02-02 10:05:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:21,603 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-02-02 10:05:21,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-02-02 10:05:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:05:21,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:21,610 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] [2018-02-02 10:05:21,610 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:21,610 INFO L82 PathProgramCache]: Analyzing trace with hash -276644944, now seen corresponding path program 1 times [2018-02-02 10:05:21,611 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:21,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:21,732 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 10:05:21,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:21,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:05:21,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:21,733 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 10:05:21,733 INFO L182 omatonBuilderFactory]: Interpolants [1685#true, 1686#false, 1687#(= 1 (select |#valid| |main_#t~malloc15.base|)), 1688#(= 1 (select |#valid| main_~list~0.base)), 1689#(= 1 (select |#valid| |append_#in~head.base|)), 1690#(= 1 (select |#valid| append_~head.base)), 1691#(or (= append_~head.base |append_#t~malloc0.base|) (= (select |#valid| append_~head.base) 1)), 1692#(or (= append_~node~0.base append_~head.base) (= (select |#valid| append_~head.base) 1))] [2018-02-02 10:05:21,733 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 10:05:21,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:05:21,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:05:21,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:05:21,734 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 8 states. [2018-02-02 10:05:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:21,978 INFO L93 Difference]: Finished difference Result 177 states and 191 transitions. [2018-02-02 10:05:21,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:05:21,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-02 10:05:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:21,979 INFO L225 Difference]: With dead ends: 177 [2018-02-02 10:05:21,980 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 10:05:21,980 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:05:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 10:05:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2018-02-02 10:05:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 10:05:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2018-02-02 10:05:21,985 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 21 [2018-02-02 10:05:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:21,985 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2018-02-02 10:05:21,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:05:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2018-02-02 10:05:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:05:21,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:21,986 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] [2018-02-02 10:05:21,986 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:21,986 INFO L82 PathProgramCache]: Analyzing trace with hash -276644943, now seen corresponding path program 1 times [2018-02-02 10:05:21,987 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:21,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:22,113 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 10:05:22,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:22,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:05:22,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:22,114 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 10:05:22,115 INFO L182 omatonBuilderFactory]: Interpolants [2016#(and (= 0 |append_#in~head.offset|) (<= 8 (select |#length| |append_#in~head.base|))), 2017#(and (<= 8 (select |#length| append_~head.base)) (= append_~head.offset 0)), 2009#true, 2010#false, 2011#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= 0 |main_#t~malloc15.offset|)), 2012#(and (= 0 main_~list~0.offset) (= (select |#length| main_~list~0.base) 8)), 2013#(and (= 0 main_~list~0.offset) (= (select |#length| main_~list~0.base) 8) (= (select |#valid| main_~list~0.base) 1)), 2014#(and (<= 8 (select |#length| main_~list~0.base)) (not (= main_~list~0.base |main_#t~malloc18.base|)) (= 0 main_~list~0.offset)), 2015#(and (<= 8 (select |#length| main_~list~0.base)) (= 0 main_~list~0.offset))] [2018-02-02 10:05:22,115 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 10:05:22,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:05:22,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:05:22,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:05:22,115 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand 9 states. [2018-02-02 10:05:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:22,301 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2018-02-02 10:05:22,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:05:22,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 10:05:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:22,302 INFO L225 Difference]: With dead ends: 187 [2018-02-02 10:05:22,302 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 10:05:22,303 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:05:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 10:05:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162. [2018-02-02 10:05:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 10:05:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions. [2018-02-02 10:05:22,307 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 21 [2018-02-02 10:05:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:22,307 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions. [2018-02-02 10:05:22,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:05:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions. [2018-02-02 10:05:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:05:22,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:22,308 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 10:05:22,308 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:22,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1018638093, now seen corresponding path program 1 times [2018-02-02 10:05:22,310 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:22,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:22,553 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 10:05:22,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:22,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:05:22,554 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:22,554 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 10:05:22,554 INFO L182 omatonBuilderFactory]: Interpolants [2375#true, 2376#false, 2377#(= (select |#valid| |main_#t~malloc15.base|) 1), 2378#(= (select |#valid| main_~list~0.base) 1), 2379#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 2380#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc18.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 2381#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~list2~0.base (store (select |#memory_$Pointer$.offset| main_~list2~0.base) main_~list2~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base main_~list2~0.base)) (= 0 (select (select (store |#memory_$Pointer$.base| main_~list2~0.base (store (select |#memory_$Pointer$.base| main_~list2~0.base) main_~list2~0.offset 0)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 2382#(and (= (select |#valid| |append_#in~head.base|) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) |append_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |append_#in~head.base|) |append_#in~head.offset|))), 2383#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) append_~head.offset)) (= (select |#valid| append_~head.base) 1)), 2384#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) append_~head.offset)) (not (= append_~head.base |append_#t~malloc0.base|))), 2385#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) append_~head.offset)) (not (= append_~head.base append_~node~0.base))), 2386#(and (not (= append_~node~0.base append_~head.base)) (= |append_#t~mem2.base| 0) (= 0 |append_#t~mem2.offset|)), 2387#(and (not (= append_~node~0.base append_~head.base)) |append_#t~short4|)] [2018-02-02 10:05:22,555 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 10:05:22,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:05:22,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:05:22,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:05:22,555 INFO L87 Difference]: Start difference. First operand 162 states and 195 transitions. Second operand 13 states. [2018-02-02 10:05:22,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:22,979 INFO L93 Difference]: Finished difference Result 228 states and 280 transitions. [2018-02-02 10:05:22,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:05:22,980 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-02 10:05:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:22,982 INFO L225 Difference]: With dead ends: 228 [2018-02-02 10:05:22,982 INFO L226 Difference]: Without dead ends: 228 [2018-02-02 10:05:22,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:05:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-02 10:05:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 171. [2018-02-02 10:05:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 10:05:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2018-02-02 10:05:22,989 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 30 [2018-02-02 10:05:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:22,990 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2018-02-02 10:05:22,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:05:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2018-02-02 10:05:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:05:22,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:22,991 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] [2018-02-02 10:05:22,991 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:22,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2019932176, now seen corresponding path program 1 times [2018-02-02 10:05:22,992 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:23,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:23,310 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 10:05:23,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:23,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:05:23,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:23,311 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 10:05:23,312 INFO L182 omatonBuilderFactory]: Interpolants [2816#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (not (= append_~head.base |append_#t~malloc0.base|))), 2817#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (not (= append_~head.base append_~node~0.base)) (= append_~head.offset 0)), 2818#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) (= |append_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (not (= append_~head.base append_~node~0.base)) (= append_~head.offset 0) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))), 2819#(and (not (= append_~head.base append_~node~0.base)) (= append_~head.offset 0) |append_#t~short4|), 2807#true, 2808#false, 2809#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 2810#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 2811#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select |#valid| main_~list~0.base) 1)), 2812#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base |main_#t~malloc18.base|)) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select |#valid| main_~list~0.base) 1)), 2813#(and (not (= main_~list~0.base main_~list2~0.base)) (= 0 main_~list~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~list2~0.base (store (select |#memory_$Pointer$.offset| main_~list2~0.base) main_~list2~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select (store |#memory_$Pointer$.base| main_~list2~0.base (store (select |#memory_$Pointer$.base| main_~list2~0.base) main_~list2~0.offset 0)) main_~list~0.base) (+ main_~list~0.offset 4))) (= (select |#valid| main_~list~0.base) 1)), 2814#(and (= 0 |append_#in~head.offset|) (= (select |#valid| |append_#in~head.base|) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ 0 4)))), 2815#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (= (select |#valid| append_~head.base) 1))] [2018-02-02 10:05:23,312 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 10:05:23,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:05:23,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:05:23,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:05:23,312 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand 13 states. [2018-02-02 10:05:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:23,660 INFO L93 Difference]: Finished difference Result 176 states and 210 transitions. [2018-02-02 10:05:23,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:05:23,661 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-02 10:05:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:23,661 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:05:23,661 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 10:05:23,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:05:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 10:05:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-02-02 10:05:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:05:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2018-02-02 10:05:23,665 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 32 [2018-02-02 10:05:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:23,666 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2018-02-02 10:05:23,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:05:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2018-02-02 10:05:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:05:23,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:23,667 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 10:05:23,667 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:23,667 INFO L82 PathProgramCache]: Analyzing trace with hash -489397259, now seen corresponding path program 1 times [2018-02-02 10:05:23,668 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:23,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:23,708 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 10:05:23,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:23,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:23,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:23,709 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 10:05:23,709 INFO L182 omatonBuilderFactory]: Interpolants [3190#true, 3191#false, 3192#(= main_~c~0 0)] [2018-02-02 10:05:23,709 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 10:05:23,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:05:23,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:05:23,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:05:23,710 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand 3 states. [2018-02-02 10:05:23,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:23,727 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2018-02-02 10:05:23,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:05:23,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-02-02 10:05:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:23,732 INFO L225 Difference]: With dead ends: 155 [2018-02-02 10:05:23,732 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 10:05:23,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 10:05:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 10:05:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2018-02-02 10:05:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 10:05:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-02-02 10:05:23,736 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 40 [2018-02-02 10:05:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:23,736 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-02-02 10:05:23,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:05:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-02-02 10:05:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:05:23,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:23,737 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] [2018-02-02 10:05:23,737 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:23,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1159244567, now seen corresponding path program 1 times [2018-02-02 10:05:23,738 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:23,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:23,846 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 10:05:23,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:23,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:05:23,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:23,847 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 10:05:23,847 INFO L182 omatonBuilderFactory]: Interpolants [3492#true, 3493#false, 3494#(= 1 (select |#valid| |main_#t~malloc18.base|)), 3495#(= 1 (select |#valid| main_~list2~0.base)), 3496#(= |#valid| |old(#valid)|), 3497#(and (= |#valid| (store |old(#valid)| |append_#t~malloc0.base| (select |#valid| |append_#t~malloc0.base|))) (= 0 (select |old(#valid)| |append_#t~malloc0.base|))), 3498#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 3499#(= 1 (select |#valid| |append_#in~head.base|)), 3500#(= 1 (select |#valid| append_~head.base)), 3501#(or (= append_~head.base |append_#t~malloc0.base|) (= (select |#valid| append_~head.base) 1)), 3502#(or (= append_~node~0.base append_~head.base) (= (select |#valid| append_~head.base) 1))] [2018-02-02 10:05:23,847 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 10:05:23,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:05:23,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:05:23,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:05:23,848 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 11 states. [2018-02-02 10:05:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:24,177 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-02-02 10:05:24,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:05:24,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-02-02 10:05:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:24,178 INFO L225 Difference]: With dead ends: 177 [2018-02-02 10:05:24,178 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 10:05:24,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:05:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 10:05:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 146. [2018-02-02 10:05:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:05:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-02-02 10:05:24,181 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 43 [2018-02-02 10:05:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:24,181 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-02-02 10:05:24,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:05:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-02-02 10:05:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:05:24,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:24,182 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] [2018-02-02 10:05:24,182 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:24,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1159244566, now seen corresponding path program 1 times [2018-02-02 10:05:24,183 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:24,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:24,324 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 10:05:24,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:24,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:05:24,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:24,325 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 10:05:24,325 INFO L182 omatonBuilderFactory]: Interpolants [3840#(and (= (select |#valid| main_~list2~0.base) 1) (= 8 (select |#length| main_~list2~0.base)) (= 0 main_~list2~0.offset)), 3841#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 3842#(and (= (store |old(#length)| |append_#t~malloc0.base| (select |#length| |append_#t~malloc0.base|)) |#length|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|))), 3843#(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|))))), 3844#(and (= 0 |append_#in~head.offset|) (= 8 (select |#length| |append_#in~head.base|))), 3845#(and (= 8 (select |#length| append_~head.base)) (= append_~head.offset 0)), 3846#(and (or (= (select |#length| append_~head.base) 8) (= 9 (select |#length| append_~head.base))) (= append_~head.offset 0)), 3836#true, 3837#false, 3838#(and (= 0 |main_#t~malloc18.offset|) (= 8 (select |#length| |main_#t~malloc18.base|))), 3839#(and (= 8 (select |#length| main_~list2~0.base)) (= 0 main_~list2~0.offset))] [2018-02-02 10:05:24,325 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 10:05:24,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:05:24,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:05:24,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:05:24,326 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 11 states. [2018-02-02 10:05:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:24,757 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2018-02-02 10:05:24,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:05:24,757 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-02-02 10:05:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:24,758 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:05:24,758 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 10:05:24,758 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:05:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 10:05:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-02-02 10:05:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 10:05:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 193 transitions. [2018-02-02 10:05:24,763 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 193 transitions. Word has length 43 [2018-02-02 10:05:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:24,763 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 193 transitions. [2018-02-02 10:05:24,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:05:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2018-02-02 10:05:24,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:05:24,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:24,765 INFO L351 BasicCegarLoop]: trace histogram [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 10:05:24,765 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:24,765 INFO L82 PathProgramCache]: Analyzing trace with hash 570613669, now seen corresponding path program 1 times [2018-02-02 10:05:24,765 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:24,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:25,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:25,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:25,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:05:25,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:25,288 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 10:05:25,288 INFO L182 omatonBuilderFactory]: Interpolants [4224#(or (and (= (select |#valid| append_~node~0.base) 1) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 5) 0)) |append_#in~head.base|) (+ (- 0) 4))) (= (select |#valid| |append_#in~head.base|) 1)))) (not (= |append_#in~head.offset| 0))), 4225#(or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= (select |#valid| |append_#in~head.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ (- 0) 4))) 1)) (not (= |append_#in~head.offset| 0))), 4226#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= (select |#valid| main_~list~0.base) 0))), 4227#(and (= 0 |append_#in~head.offset|) (not (= (select |#valid| |append_#in~head.base|) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ 0 4))))), 4228#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))) (not (= (select |#valid| append_~head.base) 0)) (= append_~head.offset 0)), 4229#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))) (= append_~head.offset 0) (not (= append_~head.base |append_#t~malloc0.base|))), 4230#(and (not (= append_~node~0.base append_~head.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))) (= append_~head.offset 0)), 4231#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 5) 0)) append_~head.base) (+ append_~head.offset 4)))) (= append_~head.offset 0)), 4232#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))) (= append_~head.offset 0)), 4233#(= (select |#valid| |append_#t~mem12.base|) 1), 4213#true, 4214#false, 4215#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 4216#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 4217#(= |#valid| |old(#valid)|), 4218#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (not (= append_~head.offset 0)) (and (= |#valid| |old(#valid)|) (= append_~head.base |append_#in~head.base|)))), 4219#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (= append_~head.base |append_#in~head.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|))) (not (= append_~head.offset 0)))), 4220#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (or (= append_~head.base |append_#in~head.base|) (= append_~head.base append_~node~0.base)) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= append_~head.base append_~node~0.base)))) (not (= append_~head.offset 0)))), 4221#(and (or (and (or (= append_~head.base |append_#in~head.base|) (= append_~head.base append_~node~0.base)) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= append_~head.base append_~node~0.base))) (= 1 (select |#valid| append_~node~0.base))) (not (= append_~head.offset 0))) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0))), 4222#(and (or (and (or (= append_~head.base |append_#in~head.base|) (= append_~head.base append_~node~0.base)) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= append_~head.base append_~node~0.base))) (= 1 (select |#valid| append_~node~0.base)) (= 1 (select |#valid| append_~head.base))) (not (= append_~head.offset 0))) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0))), 4223#(or (not (= |append_#in~head.offset| 0)) (and (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= (select |#valid| |append_#in~head.base|) 1) (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 1) 0)) |append_#in~head.base|) (+ (- 0) 4))) (not (= append_~node~0.base |append_#in~head.base|)))) (= (select |#valid| append_~node~0.base) 1)))] [2018-02-02 10:05:25,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:25,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:05:25,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:05:25,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:05:25,289 INFO L87 Difference]: Start difference. First operand 176 states and 193 transitions. Second operand 21 states. [2018-02-02 10:05:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:26,300 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2018-02-02 10:05:26,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:05:26,301 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-02-02 10:05:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:26,301 INFO L225 Difference]: With dead ends: 184 [2018-02-02 10:05:26,301 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 10:05:26,302 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:05:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 10:05:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-02-02 10:05:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:05:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 197 transitions. [2018-02-02 10:05:26,306 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 197 transitions. Word has length 50 [2018-02-02 10:05:26,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:26,307 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 197 transitions. [2018-02-02 10:05:26,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:05:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 197 transitions. [2018-02-02 10:05:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:05:26,307 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:26,308 INFO L351 BasicCegarLoop]: trace histogram [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 10:05:26,308 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:26,308 INFO L82 PathProgramCache]: Analyzing trace with hash 570613670, now seen corresponding path program 1 times [2018-02-02 10:05:26,308 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:26,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:26,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:26,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:05:26,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:26,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 10:05:26,865 INFO L182 omatonBuilderFactory]: Interpolants [4640#(and (= append_~head.base |append_#in~head.base|) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= append_~head.base append_~node~0.base))) (or (= append_~head.base append_~node~0.base) (and (= 0 append_~node~0.offset) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= 9 (select |#length| append_~node~0.base)))) (= 1 (select |#valid| append_~head.base))), 4641#(or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= (select |#valid| |append_#in~head.base|) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~node~0.base (store (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 1) 0)) |append_#in~head.base|) (+ (- 0) 4))) (= 9 (select |#length| append_~node~0.base)) (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 1) 0)) |append_#in~head.base|) (+ (- 0) 4))) (not (= append_~node~0.base |append_#in~head.base|))) (not (= |append_#in~head.offset| 0))), 4642#(or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= |append_#in~head.offset| 0)) (and (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 5) 0)) |append_#in~head.base|) (+ (- 0) 4))) (= (select |#valid| |append_#in~head.base|) 1) (= 9 (select |#length| append_~node~0.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 5) 0)) |append_#in~head.base|) (+ (- 0) 4))))), 4643#(or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= (select |#valid| |append_#in~head.base|) 1) (= 9 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ (- 0) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ (- 0) 4)))) (not (= |append_#in~head.offset| 0))), 4644#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 9 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 4645#(and (= 9 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ 0 4)))) (= 0 |append_#in~head.offset|) (= (select |#valid| |append_#in~head.base|) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ 0 4)))), 4646#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (= 9 (select |#length| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))) (= (select |#valid| append_~head.base) 1)), 4647#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (= 9 (select |#length| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))) (not (= append_~head.base |append_#t~malloc0.base|))), 4648#(and (not (= append_~node~0.base append_~head.base)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (= 9 (select |#length| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))))), 4649#(and (= 0 (select (select (store |#memory_$Pointer$.offset| append_~node~0.base (store (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 5) 0)) append_~head.base) (+ append_~head.offset 4))) (= 9 (select |#length| (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 5) 0)) append_~head.base) (+ append_~head.offset 4)))) (= append_~head.offset 0)), 4650#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (= 9 (select |#length| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))))), 4651#(and (= (select |#length| |append_#t~mem12.base|) 9) (= |append_#t~mem12.offset| 0)), 4632#true, 4633#false, 4634#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 4635#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 4636#(= |#valid| |old(#valid)|), 4637#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= |#valid| |old(#valid)|) (= append_~head.base |append_#in~head.base|)), 4638#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= 9 (select |#length| |append_#t~malloc0.base|)) (= append_~head.base |append_#in~head.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= 0 |append_#t~malloc0.offset|)), 4639#(and (= append_~head.base |append_#in~head.base|) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= append_~head.base append_~node~0.base))) (or (= append_~head.base append_~node~0.base) (and (= 0 append_~node~0.offset) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= 9 (select |#length| append_~node~0.base)))))] [2018-02-02 10:05:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:26,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:05:26,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:05:26,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:05:26,866 INFO L87 Difference]: Start difference. First operand 182 states and 197 transitions. Second operand 20 states. [2018-02-02 10:05:27,610 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 84 DAG size of output 57 [2018-02-02 10:05:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:28,004 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2018-02-02 10:05:28,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:05:28,004 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-02-02 10:05:28,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:28,005 INFO L225 Difference]: With dead ends: 183 [2018-02-02 10:05:28,005 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:05:28,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:05:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:05:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-02-02 10:05:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:05:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2018-02-02 10:05:28,008 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 50 [2018-02-02 10:05:28,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:28,008 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2018-02-02 10:05:28,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:05:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2018-02-02 10:05:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 10:05:28,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:28,008 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:28,008 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:28,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1254680052, now seen corresponding path program 1 times [2018-02-02 10:05:28,009 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:28,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:28,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:28,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:05:28,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:28,648 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 10:05:28,649 INFO L182 omatonBuilderFactory]: Interpolants [5056#(and (not (= append_~head.base append_~node~0.base)) (= |append_#t~mem2.base| 0) (= 0 |append_#t~mem2.offset|)), 5057#(and (not (= append_~head.base append_~node~0.base)) |append_#t~short4|), 5037#true, 5038#false, 5039#(= (select |#valid| main_~list~0.base) 1), 5040#(and (= (select |#valid| |main_#t~malloc18.base|) 1) (not (= main_~list~0.base |main_#t~malloc18.base|))), 5041#(and (not (= main_~list~0.base main_~list2~0.base)) (= (select |#valid| main_~list2~0.base) 1)), 5042#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list2~0.base) (+ main_~list2~0.offset 4) 0) main_~list2~0.offset)) (not (= main_~list~0.base main_~list2~0.base)) (= (select |#valid| main_~list2~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list2~0.base) (+ main_~list2~0.offset 4) 0) main_~list2~0.offset))), 5043#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5044#(and (= |#valid| |old(#valid)|) (= append_~head.base |append_#in~head.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5045#(and (= |#valid| (store |old(#valid)| |append_#t~malloc0.base| (select |#valid| |append_#t~malloc0.base|))) (= append_~head.base |append_#in~head.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5046#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (= |#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|))))), 5047#(and (= 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|) (= append_~head.base |append_#in~head.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 5048#(and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| append_~head.base (select |#memory_$Pointer$.offset| append_~head.base)) append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base))) (= 0 (select |old(#valid)| append_~node~0.base)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| append_~head.base (select |#memory_$Pointer$.base| append_~head.base)) append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= append_~head.base |append_#in~head.base|) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 5049#(and (or (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) |append_#in~head.base|)) (= 0 (select |old(#valid)| append_~node~0.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 (= (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|) |append_#in~head.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#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|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 5050#(and (= (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|) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~head.base|) (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#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 (= (@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~head.base|) (= 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|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (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|))) (= (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~head.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 5051#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list2~0.base) main_~list2~0.offset)) (= (select |#valid| main_~list2~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~list2~0.base) main_~list2~0.offset))), 5052#(and (= (select |#valid| |append_#in~head.base|) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) |append_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |append_#in~head.base|) |append_#in~head.offset|))), 5053#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) append_~head.offset)) (= (select |#valid| append_~head.base) 1)), 5054#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) append_~head.offset)) (not (= append_~head.base |append_#t~malloc0.base|))), 5055#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) append_~head.offset)) (not (= append_~head.base append_~node~0.base)))] [2018-02-02 10:05:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:28,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:05:28,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:05:28,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:05:28,650 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand 21 states. [2018-02-02 10:05:30,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:30,016 INFO L93 Difference]: Finished difference Result 278 states and 300 transitions. [2018-02-02 10:05:30,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:05:30,016 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-02-02 10:05:30,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:30,017 INFO L225 Difference]: With dead ends: 278 [2018-02-02 10:05:30,017 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 10:05:30,018 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:05:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 10:05:30,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 208. [2018-02-02 10:05:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-02 10:05:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 231 transitions. [2018-02-02 10:05:30,023 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 231 transitions. Word has length 52 [2018-02-02 10:05:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:30,023 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 231 transitions. [2018-02-02 10:05:30,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:05:30,023 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 231 transitions. [2018-02-02 10:05:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:05:30,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:30,023 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:05:30,023 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:30,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1222988087, now seen corresponding path program 1 times [2018-02-02 10:05:30,024 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:30,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:30,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:30,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:05:30,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:30,653 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 10:05:30,654 INFO L182 omatonBuilderFactory]: Interpolants [5568#true, 5569#false, 5570#(= 0 |main_#t~malloc15.offset|), 5571#(= main_~list~0.offset 0), 5572#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 5573#(and (= main_~list~0.offset 0) (= (select |#valid| |main_#t~malloc18.base|) 1) (= 0 |main_#t~malloc18.offset|) (not (= main_~list~0.base |main_#t~malloc18.base|))), 5574#(and (= main_~list~0.offset 0) (not (= main_~list~0.base main_~list2~0.base)) (= (select |#valid| main_~list2~0.base) 1) (= 0 main_~list2~0.offset)), 5575#(and (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| main_~list2~0.base) (+ main_~list2~0.offset 4))) (not (= main_~list~0.base main_~list2~0.base)) (= (select |#valid| main_~list2~0.base) 1) (= 0 main_~list2~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list2~0.base) (+ main_~list2~0.offset 4)))), 5576#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5577#(and (= |#valid| |old(#valid)|) (= append_~head.base |append_#in~head.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5578#(and (= |#valid| (store |old(#valid)| |append_#t~malloc0.base| (select |#valid| |append_#t~malloc0.base|))) (= append_~head.base |append_#in~head.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5579#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (= |#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|))))), 5580#(and (= 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|) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 5581#(and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| append_~head.base (select |#memory_$Pointer$.offset| append_~head.base)) append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base))) (= 0 (select |old(#valid)| append_~node~0.base)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| append_~head.base (select |#memory_$Pointer$.base| append_~head.base)) append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 5582#(and (or (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) |append_#in~head.base|)) (= 0 (select |old(#valid)| append_~node~0.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 (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (or (= (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|) |append_#in~head.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (= |#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|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 5583#(and (= (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|) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~head.base|) (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#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 (= (@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~head.base|) (= 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|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (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|))) (= (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~head.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 5584#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list2~0.base) (+ 0 4))) (not (= (select |#valid| main_~list2~0.base) 0)) (= 0 main_~list2~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list2~0.base) (+ 0 4)))), 5585#(and (= 0 |append_#in~head.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ 0 4))) (not (= (select |#valid| |append_#in~head.base|) 0)) (= 0 (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ 0 4)))), 5586#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) (not (= (select |#valid| append_~head.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0)), 5587#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (not (= append_~head.base |append_#t~malloc0.base|))), 5588#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) (not (= append_~head.base append_~node~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0)), 5589#(and (not (= append_~node~0.base append_~head.base)) (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) (= |append_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))), 5590#(and (not (= append_~head.base append_~node~0.base)) (= append_~head.offset 0) |append_#t~short4|)] [2018-02-02 10:05:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:30,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:05:30,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:05:30,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:05:30,654 INFO L87 Difference]: Start difference. First operand 208 states and 231 transitions. Second operand 23 states. [2018-02-02 10:05:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:32,219 INFO L93 Difference]: Finished difference Result 259 states and 276 transitions. [2018-02-02 10:05:32,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:05:32,219 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-02-02 10:05:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:32,220 INFO L225 Difference]: With dead ends: 259 [2018-02-02 10:05:32,220 INFO L226 Difference]: Without dead ends: 259 [2018-02-02 10:05:32,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=208, Invalid=1274, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:05:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-02-02 10:05:32,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 200. [2018-02-02 10:05:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-02 10:05:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2018-02-02 10:05:32,226 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 54 [2018-02-02 10:05:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:32,226 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2018-02-02 10:05:32,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:05:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2018-02-02 10:05:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:05:32,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:32,227 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:05:32,227 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:32,227 INFO L82 PathProgramCache]: Analyzing trace with hash -848788785, now seen corresponding path program 1 times [2018-02-02 10:05:32,228 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:32,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 10:05:32,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:32,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-02-02 10:05:32,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:32,267 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 10:05:32,267 INFO L182 omatonBuilderFactory]: Interpolants [6082#true, 6083#false, 6084#(= main_~c~0 0), 6085#(<= main_~c~0 1)] [2018-02-02 10:05:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 10:05:32,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:05:32,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:05:32,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:05:32,267 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 4 states. [2018-02-02 10:05:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:32,281 INFO L93 Difference]: Finished difference Result 231 states and 257 transitions. [2018-02-02 10:05:32,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:05:32,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-02-02 10:05:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:32,282 INFO L225 Difference]: With dead ends: 231 [2018-02-02 10:05:32,282 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 10:05:32,282 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 10:05:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 10:05:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2018-02-02 10:05:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 10:05:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 240 transitions. [2018-02-02 10:05:32,285 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 240 transitions. Word has length 58 [2018-02-02 10:05:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:32,285 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 240 transitions. [2018-02-02 10:05:32,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:05:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 240 transitions. [2018-02-02 10:05:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:05:32,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:32,285 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:32,286 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:32,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1740705333, now seen corresponding path program 1 times [2018-02-02 10:05:32,286 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:32,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:05:32,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:05:32,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:05:32,304 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:32,304 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 10:05:32,304 INFO L182 omatonBuilderFactory]: Interpolants [6531#true, 6532#false, 6533#(not |append_#t~short4|)] [2018-02-02 10:05:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:05:32,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:05:32,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:05:32,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:05:32,305 INFO L87 Difference]: Start difference. First operand 214 states and 240 transitions. Second operand 3 states. [2018-02-02 10:05:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:32,309 INFO L93 Difference]: Finished difference Result 216 states and 242 transitions. [2018-02-02 10:05:32,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:05:32,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-02-02 10:05:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:32,310 INFO L225 Difference]: With dead ends: 216 [2018-02-02 10:05:32,310 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 10:05:32,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 10:05:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 10:05:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-02 10:05:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 10:05:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 242 transitions. [2018-02-02 10:05:32,313 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 242 transitions. Word has length 61 [2018-02-02 10:05:32,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:32,313 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 242 transitions. [2018-02-02 10:05:32,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:05:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 242 transitions. [2018-02-02 10:05:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:05:32,314 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:32,314 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 10:05:32,314 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:32,314 INFO L82 PathProgramCache]: Analyzing trace with hash -618908496, now seen corresponding path program 1 times [2018-02-02 10:05:32,315 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:32,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:05:32,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:32,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:05:32,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:32,477 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 10:05:32,477 INFO L182 omatonBuilderFactory]: Interpolants [6976#(and (<= 8 (select |#length| append_~head.base)) (= append_~head.offset 0) (= (select |#valid| append_~head.base) 1)), 6977#(and (<= 8 (select |#length| append_~head.base)) (= append_~head.offset 0)), 6966#true, 6967#false, 6968#(= 0 |main_#t~malloc18.offset|), 6969#(= 0 main_~list2~0.offset), 6970#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= append_~head.base |append_#in~head.base|)), 6971#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= append_~head.base |append_#in~head.base|) (= 1 (select |#valid| append_~head.base))), 6972#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (<= (+ append_~head.offset 8) (select |#length| append_~head.base)) (not (= append_~head.offset 0))) (= append_~head.base |append_#in~head.base|) (= (select |#valid| append_~head.base) 1)), 6973#(and (= (select |#valid| |append_#in~head.base|) 1) (or (<= 8 (select |#length| |append_#in~head.base|)) (not (= |append_#in~head.offset| 0)))), 6974#(and (= (select |#valid| main_~list2~0.base) 1) (<= 8 (select |#length| main_~list2~0.base)) (= 0 main_~list2~0.offset)), 6975#(and (= 0 |append_#in~head.offset|) (= (select |#valid| |append_#in~head.base|) 1) (<= 8 (select |#length| |append_#in~head.base|)))] [2018-02-02 10:05:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:05:32,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:05:32,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:05:32,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:05:32,478 INFO L87 Difference]: Start difference. First operand 216 states and 242 transitions. Second operand 12 states. [2018-02-02 10:05:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:32,768 INFO L93 Difference]: Finished difference Result 258 states and 279 transitions. [2018-02-02 10:05:32,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:05:32,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-02 10:05:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:32,769 INFO L225 Difference]: With dead ends: 258 [2018-02-02 10:05:32,770 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:05:32,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:05:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:05:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 242. [2018-02-02 10:05:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 10:05:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 269 transitions. [2018-02-02 10:05:32,775 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 269 transitions. Word has length 63 [2018-02-02 10:05:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:32,775 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 269 transitions. [2018-02-02 10:05:32,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:05:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 269 transitions. [2018-02-02 10:05:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:05:32,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:32,776 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-02-02 10:05:32,776 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:32,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1647748270, now seen corresponding path program 1 times [2018-02-02 10:05:32,777 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:32,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:33,284 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:33,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:33,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:05:33,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:33,285 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 10:05:33,285 INFO L182 omatonBuilderFactory]: Interpolants [7488#(= (select |#valid| main_~list~0.base) 1), 7489#(= |#valid| |old(#valid)|), 7490#(and (= append_~head.offset |append_#in~head.offset|) (= |#valid| |old(#valid)|) (= append_~head.base |append_#in~head.base|)), 7491#(and (= append_~head.offset |append_#in~head.offset|) (not (= 0 |append_#t~malloc0.base|)) (= append_~head.base |append_#in~head.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|))), 7492#(and (= append_~head.offset |append_#in~head.offset|) (not (= 0 append_~node~0.base)) (or (= append_~head.base |append_#in~head.base|) (= append_~head.base append_~node~0.base)) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= append_~head.base append_~node~0.base)))), 7493#(and (= append_~head.offset |append_#in~head.offset|) (not (= 0 append_~node~0.base)) (or (= append_~head.base |append_#in~head.base|) (= append_~head.base append_~node~0.base)) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= append_~head.base append_~node~0.base))) (= 1 (select |#valid| append_~head.base))), 7494#(and (= append_~head.offset |append_#in~head.offset|) (or (= append_~head.base |append_#in~head.base|) (= append_~head.base append_~node~0.base)) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= append_~head.base append_~node~0.base))) (not (= 0 (select (store (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4) append_~node~0.base) append_~head.offset))) (= (select |#valid| append_~head.base) 1)), 7495#(or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= (select |#valid| |append_#in~head.base|) 1) (not (= append_~node~0.base |append_#in~head.base|)) (not (= 0 (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 1) 0)) |append_#in~head.base|) |append_#in~head.offset|))))), 7496#(or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= (select |#valid| |append_#in~head.base|) 1) (not (= 0 (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 5) 0)) |append_#in~head.base|) |append_#in~head.offset|))))), 7497#(or (and (= (select |#valid| |append_#in~head.base|) 1) (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~head.base|) |append_#in~head.offset|)))) (= 0 (select |old(#valid)| |append_#in~head.base|))), 7498#(and (not (= (select |#valid| main_~list~0.base) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 7499#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7500#(and (= append_~head.offset |append_#in~head.offset|) (= |#valid| |old(#valid)|) (= append_~head.base |append_#in~head.base|) (= (select |old(#memory_$Pointer$.base)| append_~head.base) (select |#memory_$Pointer$.base| append_~head.base))), 7501#(and (= append_~head.offset |append_#in~head.offset|) (= append_~head.base |append_#in~head.base|) (= (select |old(#memory_$Pointer$.base)| append_~head.base) (select |#memory_$Pointer$.base| append_~head.base)) (= 0 (select |old(#valid)| |append_#t~malloc0.base|))), 7502#(and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~head.offset |append_#in~head.offset|) (= append_~head.base |append_#in~head.base|) (= (select |old(#memory_$Pointer$.base)| append_~head.base) (select |#memory_$Pointer$.base| append_~head.base))), 7503#(and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~head.offset |append_#in~head.offset|) (= append_~head.base |append_#in~head.base|) (or (= (select |old(#memory_$Pointer$.base)| append_~head.base) (select |#memory_$Pointer$.base| append_~head.base)) (= append_~node~0.base append_~head.base))), 7504#(and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~head.offset |append_#in~head.offset|) (= append_~head.base |append_#in~head.base|) (or (= (select |old(#memory_$Pointer$.base)| append_~head.base) (select |#memory_$Pointer$.base| append_~head.base)) (= append_~node~0.base append_~head.base)) (= (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset) |append_#t~mem2.base|)), 7505#(and (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~head.base |append_#in~head.base|) (or (= (select |old(#memory_$Pointer$.base)| append_~head.base) (select |#memory_$Pointer$.base| append_~head.base)) (= append_~node~0.base append_~head.base)) (or (not |append_#t~short4|) (and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (= append_~head.offset |append_#in~head.offset|)))), 7506#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (= 0 (select |old(#valid)| append_~node~0.base)) (= append_~head.offset |append_#in~head.offset|) (= append_~head.base |append_#in~head.base|) (or (= (select |old(#memory_$Pointer$.base)| append_~head.base) (select |#memory_$Pointer$.base| append_~head.base)) (= append_~node~0.base append_~head.base))), 7507#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (and (= 0 (select (select |old(#memory_$Pointer$.base)| append_~head.base) append_~head.offset)) (= append_~head.offset |append_#in~head.offset|)) (= append_~node~0.base append_~head.base)) (= append_~head.base |append_#in~head.base|)), 7508#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= 0 (select (select |old(#memory_$Pointer$.base)| |append_#in~head.base|) |append_#in~head.offset|)) (= append_~node~0.base |append_#in~head.base|))), 7509#(or (= 0 (select |old(#valid)| |append_#in~head.base|)) (= 0 (select (select |old(#memory_$Pointer$.base)| |append_#in~head.base|) |append_#in~head.offset|))), 7485#true, 7486#false, 7487#(= (select |#valid| |main_#t~malloc15.base|) 1)] [2018-02-02 10:05:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:33,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:05:33,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:05:33,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:05:33,286 INFO L87 Difference]: Start difference. First operand 242 states and 269 transitions. Second operand 25 states. [2018-02-02 10:05:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:34,743 INFO L93 Difference]: Finished difference Result 282 states and 305 transitions. [2018-02-02 10:05:34,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:05:34,744 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2018-02-02 10:05:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:34,745 INFO L225 Difference]: With dead ends: 282 [2018-02-02 10:05:34,745 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 10:05:34,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=405, Invalid=2351, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:05:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 10:05:34,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 213. [2018-02-02 10:05:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 10:05:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 232 transitions. [2018-02-02 10:05:34,750 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 232 transitions. Word has length 63 [2018-02-02 10:05:34,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:34,750 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 232 transitions. [2018-02-02 10:05:34,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:05:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 232 transitions. [2018-02-02 10:05:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:05:34,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:34,751 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-02-02 10:05:34,751 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:34,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1373725626, now seen corresponding path program 1 times [2018-02-02 10:05:34,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:34,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:34,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:34,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:05:34,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:34,999 INFO L182 omatonBuilderFactory]: Interpolants [8064#(and (= 8 (select |#length| main_~list2~0.base)) (= 0 main_~list2~0.offset)), 8065#(and (= (select |#valid| main_~list2~0.base) 1) (= 8 (select |#length| main_~list2~0.base)) (= 0 main_~list2~0.offset)), 8066#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 8067#(and (= (store |old(#length)| |append_#t~malloc0.base| (select |#length| |append_#t~malloc0.base|)) |#length|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|))), 8068#(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|))))), 8069#(= |old(#length)| |#length|), 8070#(and (= (store |old(#length)| |append_#t~malloc0.base| (select |#length| |append_#t~malloc0.base|)) |#length|) (= 9 (select |#length| |append_#t~malloc0.base|))), 8071#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (and (= 9 (select |#length| append_~node~0.base)) (= append_~node~0.base (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|))), 8072#(and (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= 9 (select |#length| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|))), 8073#(and (or (= 9 (select |#length| main_~list2~0.base)) (= 8 (select |#length| main_~list2~0.base))) (= 0 main_~list2~0.offset)), 8074#(and (= 0 |append_#in~head.offset|) (or (= 9 (select |#length| |append_#in~head.base|)) (= 8 (select |#length| |append_#in~head.base|)))), 8075#(and (or (= 8 (select |#length| append_~head.base)) (= 9 (select |#length| append_~head.base))) (= append_~head.offset 0)), 8061#true, 8062#false, 8063#(and (= 0 |main_#t~malloc18.offset|) (= 8 (select |#length| |main_#t~malloc18.base|)))] [2018-02-02 10:05:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:05:34,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:05:34,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:05:34,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:05:35,000 INFO L87 Difference]: Start difference. First operand 213 states and 232 transitions. Second operand 15 states. [2018-02-02 10:05:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:35,439 INFO L93 Difference]: Finished difference Result 207 states and 227 transitions. [2018-02-02 10:05:35,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:05:35,439 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-02-02 10:05:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:35,440 INFO L225 Difference]: With dead ends: 207 [2018-02-02 10:05:35,440 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 10:05:35,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:05:35,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 10:05:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-02-02 10:05:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 10:05:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 224 transitions. [2018-02-02 10:05:35,443 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 224 transitions. Word has length 65 [2018-02-02 10:05:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:35,443 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 224 transitions. [2018-02-02 10:05:35,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:05:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 224 transitions. [2018-02-02 10:05:35,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:05:35,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:35,443 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:35,444 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 258761966, now seen corresponding path program 1 times [2018-02-02 10:05:35,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:35,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:05:36,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:36,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:05:36,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:36,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 10:05:36,031 INFO L182 omatonBuilderFactory]: Interpolants [8512#(and (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 8513#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 8514#(and (= (select |#valid| main_~list2~0.base) 1) (= 0 main_~list2~0.offset)), 8515#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (not (= append_~head.offset 0)) (and (= |#valid| |old(#valid)|) (= append_~head.base |append_#in~head.base|)))), 8516#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (= append_~head.base |append_#in~head.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|))) (not (= append_~head.offset 0)))), 8517#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (or (= append_~head.base |append_#in~head.base|) (= append_~node~0.base append_~head.base)) (or (not (= append_~node~0.base append_~head.base)) (= 0 (select |old(#valid)| |append_#in~head.base|)))) (not (= append_~head.offset 0)))), 8518#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (or (= append_~head.base |append_#in~head.base|) (= append_~node~0.base append_~head.base)) (or (not (= append_~node~0.base append_~head.base)) (= 0 (select |old(#valid)| |append_#in~head.base|))) (= 1 (select |#valid| append_~node~0.base))) (not (= append_~head.offset 0)))), 8519#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (or (and (= append_~head.base |append_#in~head.base|) (= 1 (select |#valid| append_~head.base))) (= append_~node~0.base append_~head.base)) (or (not (= append_~node~0.base append_~head.base)) (= 0 (select |old(#valid)| |append_#in~head.base|))) (= 1 (select |#valid| append_~node~0.base))) (not (= append_~head.offset 0)))), 8520#(or (not (= |append_#in~head.offset| 0)) (and (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= (select |#valid| |append_#in~head.base|) 1) (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 1) 0)) |append_#in~head.base|) (+ (- 0) 4))) (not (= append_~node~0.base |append_#in~head.base|)))) (= (select |#valid| append_~node~0.base) 1))), 8521#(or (and (= (select |#valid| append_~node~0.base) 1) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 5) 0)) |append_#in~head.base|) (+ (- 0) 4))) (= (select |#valid| |append_#in~head.base|) 1)))) (not (= |append_#in~head.offset| 0))), 8522#(or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= (select |#valid| |append_#in~head.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ (- 0) 4))) 1)) (not (= |append_#in~head.offset| 0))), 8523#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list2~0.base) (+ 0 4)))) (not (= (select |#valid| main_~list2~0.base) 0)) (= 0 main_~list2~0.offset)), 8524#(and (= 0 |append_#in~head.offset|) (not (= (select |#valid| |append_#in~head.base|) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ 0 4))))), 8525#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))) (not (= (select |#valid| append_~head.base) 0)) (= append_~head.offset 0)), 8526#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))) (= append_~head.offset 0) (not (= append_~head.base |append_#t~malloc0.base|))), 8527#(and (not (= append_~node~0.base append_~head.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))) (= append_~head.offset 0)), 8528#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 5) 0)) append_~head.base) (+ append_~head.offset 4)))) (= append_~head.offset 0)), 8529#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))) (= append_~head.offset 0)), 8530#(= (select |#valid| |append_#t~mem12.base|) 1), 8504#true, 8505#false, 8506#(= 0 |main_#t~malloc15.offset|), 8507#(= main_~list~0.offset 0), 8508#(and (= main_~list~0.offset 0) (= (select |#valid| |main_#t~malloc18.base|) 1) (= 0 |main_#t~malloc18.offset|)), 8509#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list2~0.base) 1) (= 0 main_~list2~0.offset)), 8510#(= |#valid| |old(#valid)|), 8511#(= |#valid| (store |old(#valid)| |append_#t~malloc0.base| (select |#valid| |append_#t~malloc0.base|)))] [2018-02-02 10:05:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:05:36,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:05:36,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:05:36,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:05:36,031 INFO L87 Difference]: Start difference. First operand 205 states and 224 transitions. Second operand 27 states. [2018-02-02 10:05:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:37,383 INFO L93 Difference]: Finished difference Result 227 states and 244 transitions. [2018-02-02 10:05:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:05:37,383 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2018-02-02 10:05:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:37,384 INFO L225 Difference]: With dead ends: 227 [2018-02-02 10:05:37,384 INFO L226 Difference]: Without dead ends: 227 [2018-02-02 10:05:37,385 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=301, Invalid=1861, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:05:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-02 10:05:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 205. [2018-02-02 10:05:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 10:05:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 223 transitions. [2018-02-02 10:05:37,389 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 223 transitions. Word has length 72 [2018-02-02 10:05:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:37,389 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 223 transitions. [2018-02-02 10:05:37,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:05:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 223 transitions. [2018-02-02 10:05:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:05:37,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:37,390 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:37,390 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:37,390 INFO L82 PathProgramCache]: Analyzing trace with hash 258761967, now seen corresponding path program 1 times [2018-02-02 10:05:37,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:37,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:05:38,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:38,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:05:38,064 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:38,065 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 10:05:38,065 INFO L182 omatonBuilderFactory]: Interpolants [9024#(and (not (= (select |#valid| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) 0)) (not (= (select |#valid| append_~head.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (= 9 (select |#length| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))))), 9025#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (= 9 (select |#length| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))) (not (= append_~head.base |append_#t~malloc0.base|))), 9026#(and (not (= append_~node~0.base append_~head.base)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (= 9 (select |#length| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))))), 9027#(and (= 0 (select (select (store |#memory_$Pointer$.offset| append_~node~0.base (store (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 5) 0)) append_~head.base) (+ append_~head.offset 4))) (= 9 (select |#length| (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 5) 0)) append_~head.base) (+ append_~head.offset 4)))) (= append_~head.offset 0)), 9028#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (= 9 (select |#length| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))))), 9029#(and (= (select |#length| |append_#t~mem12.base|) 9) (= |append_#t~mem12.offset| 0)), 9003#true, 9004#false, 9005#(= 0 |main_#t~malloc15.offset|), 9006#(= main_~list~0.offset 0), 9007#(and (= main_~list~0.offset 0) (= (select |#valid| |main_#t~malloc18.base|) 1) (= 0 |main_#t~malloc18.offset|)), 9008#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list2~0.base) 1) (= 0 main_~list2~0.offset)), 9009#(= |#valid| |old(#valid)|), 9010#(= |#valid| (store |old(#valid)| |append_#t~malloc0.base| (select |#valid| |append_#t~malloc0.base|))), 9011#(and (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9012#(and (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9013#(and (not (= (select |#valid| main_~list2~0.base) 0)) (= 0 main_~list2~0.offset)), 9014#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= |#valid| |old(#valid)|) (= append_~head.base |append_#in~head.base|)), 9015#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= append_~head.base |append_#in~head.base|) (or (and (= 9 (select |#length| |append_#t~malloc0.base|)) (= 0 |append_#t~malloc0.offset|)) (not (= append_~head.offset 0))) (= 0 (select |old(#valid)| |append_#t~malloc0.base|))), 9016#(and (or (= append_~node~0.base append_~head.base) (and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (= 0 append_~node~0.offset) (= append_~head.base |append_#in~head.base|) (= 9 (select |#length| append_~node~0.base))) (not (= append_~head.offset 0))))) (or (not (= append_~node~0.base append_~head.base)) (= 0 (select |old(#valid)| |append_#in~head.base|)))), 9017#(and (or (and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (= 0 append_~node~0.offset) (= append_~head.base |append_#in~head.base|) (= 9 (select |#length| append_~node~0.base)) (= (select |#valid| append_~node~0.base) 1)) (not (= append_~head.offset 0)))) (= append_~node~0.base append_~head.base)) (or (not (= append_~node~0.base append_~head.base)) (= 0 (select |old(#valid)| |append_#in~head.base|)))), 9018#(and (or (and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (= 0 append_~node~0.offset) (= append_~head.base |append_#in~head.base|) (= 9 (select |#length| append_~node~0.base)) (= (select |#valid| append_~node~0.base) 1)) (not (= append_~head.offset 0))) (= 1 (select |#valid| append_~head.base))) (= append_~node~0.base append_~head.base)) (or (not (= append_~node~0.base append_~head.base)) (= 0 (select |old(#valid)| |append_#in~head.base|)))), 9019#(or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= |append_#in~head.offset| 0)) (and (= (select |#valid| |append_#in~head.base|) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~node~0.base (store (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 1) 0)) |append_#in~head.base|) (+ (- 0) 4))) (= 9 (select |#length| append_~node~0.base)) (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 1) 0)) |append_#in~head.base|) (+ (- 0) 4))) (= (select |#valid| append_~node~0.base) 1) (not (= append_~node~0.base |append_#in~head.base|)))), 9020#(or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= append_~node~0.base (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 5) 0)) |append_#in~head.base|) (+ (- 0) 4))) (= (select |#valid| |append_#in~head.base|) 1) (= 9 (select |#length| append_~node~0.base)) (= (select |#valid| append_~node~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~node~0.base (store (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 5) 0)) |append_#in~head.base|) (+ (- 0) 4)))) (not (= |append_#in~head.offset| 0))), 9021#(or (and (= (select |#valid| |append_#in~head.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ (- 0) 4))) 1) (= 9 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ (- 0) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ (- 0) 4)))) (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= |append_#in~head.offset| 0))), 9022#(and (not (= (select |#valid| main_~list2~0.base) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~list2~0.base) (+ 0 4))) 0)) (= 9 (select |#length| (select (select |#memory_$Pointer$.base| main_~list2~0.base) (+ 0 4)))) (= 0 main_~list2~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list2~0.base) (+ 0 4)))), 9023#(and (= 9 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ 0 4)))) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ 0 4))) 0)) (= 0 |append_#in~head.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ 0 4))) (not (= (select |#valid| |append_#in~head.base|) 0)))] [2018-02-02 10:05:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:05:38,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:05:38,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:05:38,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:05:38,066 INFO L87 Difference]: Start difference. First operand 205 states and 223 transitions. Second operand 27 states. [2018-02-02 10:05:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:39,658 INFO L93 Difference]: Finished difference Result 226 states and 243 transitions. [2018-02-02 10:05:39,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:05:39,658 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2018-02-02 10:05:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:39,659 INFO L225 Difference]: With dead ends: 226 [2018-02-02 10:05:39,659 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 10:05:39,659 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=299, Invalid=1771, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:05:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 10:05:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 205. [2018-02-02 10:05:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 10:05:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 222 transitions. [2018-02-02 10:05:39,662 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 222 transitions. Word has length 72 [2018-02-02 10:05:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:39,662 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 222 transitions. [2018-02-02 10:05:39,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:05:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 222 transitions. [2018-02-02 10:05:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:05:39,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:39,662 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:05:39,663 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:39,663 INFO L82 PathProgramCache]: Analyzing trace with hash 775300632, now seen corresponding path program 1 times [2018-02-02 10:05:39,663 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:39,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:40,977 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 67 DAG size of output 63 [2018-02-02 10:05:41,314 WARN L143 SmtUtils]: Spent 230ms on a formula simplification that was a NOOP. DAG size: 83 [2018-02-02 10:05:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:05:41,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:41,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:05:41,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:41,538 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 10:05:41,538 INFO L182 omatonBuilderFactory]: Interpolants [9499#true, 9500#false, 9501#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 9502#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 9503#(and (= (select |#valid| |main_#t~malloc18.base|) 1) (not (= main_~list~0.base |main_#t~malloc18.base|)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 9504#(and (not (= main_~list~0.base main_~list2~0.base)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list2~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 9505#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list2~0.base) (+ main_~list2~0.offset 4) 0) main_~list2~0.offset)) (not (= main_~list~0.base main_~list2~0.base)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list2~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list2~0.base) (+ main_~list2~0.offset 4) 0) main_~list2~0.offset))), 9506#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9507#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= |#valid| |old(#valid)|) (= append_~head.base |append_#in~head.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9508#(and (= |#valid| (store |old(#valid)| |append_#t~malloc0.base| (select |#valid| |append_#t~malloc0.base|))) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= append_~head.base |append_#in~head.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9509#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= append_~head.base |append_#in~head.base|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#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|))))), 9510#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= append_~head.base |append_#in~head.base|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9511#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= append_~head.base |append_#in~head.base|) (or (= 1 (select |#valid| append_~head.base)) (not (= append_~head.offset 0))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9512#(and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| append_~head.base (select |#memory_$Pointer$.offset| append_~head.base)) append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base))) (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| append_~head.base (select |#memory_$Pointer$.base| append_~head.base)) append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (or (not (= append_~head.offset 0)) (= (select |#valid| append_~head.base) 1)) (= append_~head.base |append_#in~head.base|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9513#(and (or (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) |append_#in~head.base|)) (= 0 (select |old(#valid)| append_~node~0.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)| |append_#in~head.base|)) (not (= |append_#in~head.offset| 0)) (and (= (select |#valid| |append_#in~head.base|) 1) (= 0 (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| append_~node~0.base (store (select |#memory_$Pointer$.base| append_~node~0.base) (+ append_~node~0.offset 1) 0)) |append_#in~head.base|) (+ (- 0) 4)))))) (or (= (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|) |append_#in~head.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#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|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9514#(and (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= (select |#valid| |append_#in~head.base|) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ (- 0) 4))))) (not (= |append_#in~head.offset| 0))) (= (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|) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~head.base|) (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#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 (= (@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~head.base|) (= 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|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (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|))) (= (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~head.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9515#(and (not (= main_~list2~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~list~0.base main_~list2~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~list2~0.base) main_~list2~0.offset)) (not (= (select |#valid| main_~list2~0.base) 0)) (= 0 main_~list~0.offset) (not (= (select |#valid| main_~list~0.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list2~0.base) main_~list2~0.offset))), 9516#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (= |#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|))))), 9517#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= (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)|)) (= append_~head.base |append_#in~head.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9518#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (or (= (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)) |append_#t~mem12.base|) (not (= append_~head.offset 0))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9519#(and (= 0 (select |old(#valid)| append_~node~0.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 (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (and (or (and (or (= (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) append_~head.base) (= (select |old(#memory_$Pointer$.base)| append_~head.base) (select |#memory_$Pointer$.base| append_~head.base)) (= append_~node~0.base append_~head.base)) (or (= (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)) (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|)) (= (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) |append_#in~head.base|))) (not (= append_~head.offset 0))) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)))) (or (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)) (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|)) (= (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|) |append_#in~head.base|) (not (= append_~head.offset 0))))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (= |#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|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9520#(and (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (= 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|))) (= (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|) (not (= |append_#in~head.offset| 0)) (= (@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~head.base|) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~head.base|) (+ (- 0) 4)) (@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|))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= 0 (select |old(#valid)| |append_#in~head.base|)) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~head.base|) (not (= |append_#in~head.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~head.base|) (+ (- 0) 4)) (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (= (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|))) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~head.base|) (+ (- 0) 4)) (@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|)) (not (= |append_#in~head.offset| 0)) (= (@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~head.base|)) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~head.base|) (= 0 (select |old(#valid)| |append_#in~head.base|)) (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~head.base|) (+ (- 0) 4)) (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (not (= |append_#in~head.offset| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (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)| |append_#in~head.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~head.base|) (= 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|)))) (not (= |append_#in~head.offset| 0)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~head.base|) (+ (- 0) 4)) (@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 (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~head.base|) (+ (- 0) 4)) (@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| (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|)))) (not (= |append_#in~head.offset| 0)) (= (@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~head.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|)))) (= (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|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9521#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list2~0.base) main_~list2~0.offset)) (not (= (select |#valid| main_~list2~0.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list2~0.base) main_~list2~0.offset))), 9522#(and (not (= (select |#valid| |append_#in~head.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) |append_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |append_#in~head.base|) |append_#in~head.offset|))), 9523#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (not (= (select |#valid| append_~head.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) append_~head.offset))), 9524#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) append_~head.offset)) (not (= append_~head.base |append_#t~malloc0.base|))), 9525#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) append_~head.offset)) (not (= append_~head.base append_~node~0.base))), 9526#(and (not (= append_~head.base append_~node~0.base)) (= |append_#t~mem2.base| 0) (= 0 |append_#t~mem2.offset|)), 9527#|append_#t~short4|] [2018-02-02 10:05:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:05:41,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:05:41,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:05:41,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:05:41,539 INFO L87 Difference]: Start difference. First operand 205 states and 222 transitions. Second operand 29 states. [2018-02-02 10:05:41,883 WARN L143 SmtUtils]: Spent 222ms on a formula simplification that was a NOOP. DAG size: 89 [2018-02-02 10:05:42,320 WARN L143 SmtUtils]: Spent 234ms on a formula simplification that was a NOOP. DAG size: 94 [2018-02-02 10:05:43,124 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 96 DAG size of output 65 [2018-02-02 10:05:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:44,751 INFO L93 Difference]: Finished difference Result 256 states and 279 transitions. [2018-02-02 10:05:44,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:05:44,752 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 74 [2018-02-02 10:05:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:44,753 INFO L225 Difference]: With dead ends: 256 [2018-02-02 10:05:44,753 INFO L226 Difference]: Without dead ends: 256 [2018-02-02 10:05:44,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=310, Invalid=2240, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:05:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-02-02 10:05:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 209. [2018-02-02 10:05:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 10:05:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 225 transitions. [2018-02-02 10:05:44,757 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 225 transitions. Word has length 74 [2018-02-02 10:05:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:44,757 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 225 transitions. [2018-02-02 10:05:44,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:05:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 225 transitions. [2018-02-02 10:05:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:05:44,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:44,758 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 10:05:44,758 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:44,758 INFO L82 PathProgramCache]: Analyzing trace with hash 100866139, now seen corresponding path program 2 times [2018-02-02 10:05:44,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:44,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:45,896 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 70 DAG size of output 68 [2018-02-02 10:05:46,300 WARN L146 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 79 DAG size of output 79 [2018-02-02 10:05:47,025 WARN L146 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 83 DAG size of output 78 [2018-02-02 10:05:48,029 WARN L146 SmtUtils]: Spent 755ms on a formula simplification. DAG size of input: 116 DAG size of output 116 [2018-02-02 10:05:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:05:48,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:48,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:05:48,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:48,390 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 10:05:48,391 INFO L182 omatonBuilderFactory]: Interpolants [10048#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (or (and (= 0 append_~node~0.offset) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))) (= append_~head.base append_~node~0.base))) (not (= append_~head.offset 0))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10049#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= 1 (select |#valid| append_~head.base)) (or (and (= 0 append_~node~0.offset) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))) (= append_~head.base append_~node~0.base))) (not (= append_~head.offset 0))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10050#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (or (and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| append_~head.base (select |#memory_$Pointer$.offset| append_~head.base)) append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| append_~head.base (select |#memory_$Pointer$.base| append_~head.base)) append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (or (and (= 0 append_~node~0.offset) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))) (= append_~head.base append_~node~0.base)) (= (select |#valid| append_~head.base) 1)) (not (= append_~head.offset 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10051#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (or (not (= |append_#in~head.offset| 0)) (and (or (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) |append_#in~head.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)| |append_#in~head.base|)) (and (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |#valid| |append_#in~head.base|) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~node~0.base (store (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 1) 0)) |append_#in~head.base|) (+ (- 0) 4))))) (or (= (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|) |append_#in~head.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (= |#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|)))))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10052#(and (or (not (= |append_#in~head.offset| 0)) (and (= (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|) (or (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|)))) (= (select |#valid| |append_#in~head.base|) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ (- 0) 4)))) (= 0 (select |old(#valid)| |append_#in~head.base|))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~head.base|) (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#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 (= (@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~head.base|) (= 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|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.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|))) (= (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~head.base|)))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10053#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list2~0.base) (+ main_~list2~0.offset 4))) (not (= main_~list~0.base main_~list2~0.base)) (not (= (select |#valid| main_~list2~0.base) 0)) (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list2~0.base)) (not (= (select |#valid| main_~list~0.base) 0)) (= 0 main_~list2~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list2~0.base) (+ main_~list2~0.offset 4)))), 10054#(and (= |#valid| (store |old(#valid)| |append_#t~malloc0.base| (select |#valid| |append_#t~malloc0.base|))) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= append_~head.base |append_#in~head.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (or (and (= (store |old(#length)| |append_#t~malloc0.base| (select |#length| |append_#t~malloc0.base|)) |#length|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= append_~head.offset 0)))), 10055#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (or (and (or (= append_~node~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)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= append_~head.offset 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10056#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (= (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(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (not (= append_~head.offset 0))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10057#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (or (and (= (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(#length)| |#length|)) (= |old(#length)| |#length|)) (or (= append_~head.base |append_#t~mem12.base|) (= |append_#t~mem12.offset| 0) (= (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4)) |append_#t~mem12.offset|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (not (= append_~head.offset 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10058#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (= |#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 (and (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|) |append_#in~head.base|) (and (or (= (select |#memory_$Pointer$.offset| append_~head.base) (select |old(#memory_$Pointer$.offset)| append_~head.base)) (= append_~node~0.base append_~head.base)) (or (<= 9 (select |#length| (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|))) (not (= (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4)) 0)))))) (= |#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|) (and (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (not (= (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4)) 0)) (= (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) |append_#in~head.base|) (<= 9 (select |#length| (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.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|))))) (not (= append_~head.offset 0))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10059#(and (or (and (or (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|)))) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) 0)) (<= 9 (select |#length| (@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|))) (= (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~head.base|)) (or (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|)))) (or (<= 9 (select |#length| (@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|))) (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) 0)))) (= (@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~head.base|) (= 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|))))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~head.base|) (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|)))) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (<= 9 (select |#length| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) 0)))) (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= (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|))) (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|)))) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (<= 9 (select |#length| (@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|))) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) 0)))) (= (@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~head.base|)) (= (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$.offset)| |#memory_$Pointer$.offset|))) (and (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (<= 9 (select |#length| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) 0))) (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|))))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (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|)))) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (<= 9 (select |#length| (@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|))) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) 0)))) (= |#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|)))) (= (@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~head.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|)))) (= (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|)) (not (= |append_#in~head.offset| 0))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10060#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list2~0.base) (+ 0 4))) (not (= (select |#valid| main_~list2~0.base) 0)) (= 0 main_~list2~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list2~0.base) (+ 0 4)))), 10061#(and (= 0 |append_#in~head.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ 0 4))) (not (= (select |#valid| |append_#in~head.base|) 0)) (= 0 (select (select |#memory_$Pointer$.base| |append_#in~head.base|) (+ 0 4)))), 10062#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) (not (= (select |#valid| append_~head.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0)), 10063#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.offset 0) (not (= append_~head.base |append_#t~malloc0.base|))), 10064#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (not (= append_~head.base append_~node~0.base)) (= append_~head.offset 0)), 10065#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4))) (= |append_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (not (= append_~head.base append_~node~0.base)) (= append_~head.offset 0) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~head.base) (+ append_~head.offset 4)))), 10066#(and (not (= append_~head.base append_~node~0.base)) (= append_~head.offset 0) |append_#t~short4|), 10037#true, 10038#false, 10039#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 10040#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 10041#(and (= (select |#valid| |main_#t~malloc18.base|) 1) (= 0 |main_#t~malloc18.offset|) (not (= main_~list~0.base |main_#t~malloc18.base|)) (= 0 main_~list~0.offset) (= 8 (select |#length| |main_#t~malloc18.base|)) (= (select |#valid| main_~list~0.base) 1)), 10042#(and (not (= main_~list~0.base main_~list2~0.base)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list2~0.base) 1) (= 8 (select |#length| main_~list2~0.base)) (= 0 main_~list2~0.offset) (= (select |#valid| main_~list~0.base) 1)), 10043#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list2~0.base) (+ main_~list2~0.offset 4))) (not (= main_~list~0.base main_~list2~0.base)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list2~0.base) 1) (= 8 (select |#length| main_~list2~0.base)) (= 0 main_~list2~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~list2~0.base) (+ main_~list2~0.offset 4))) (= (select |#valid| main_~list~0.base) 1)), 10044#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10045#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= append_~head.offset 0))) (= |#valid| |old(#valid)|) (= append_~head.base |append_#in~head.base|)), 10046#(and (= |#valid| (store |old(#valid)| |append_#t~malloc0.base| (select |#valid| |append_#t~malloc0.base|))) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (= (store |old(#length)| |append_#t~malloc0.base| (select |#length| |append_#t~malloc0.base|)) |#length|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 |append_#t~malloc0.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= append_~head.offset 0))) (= append_~head.base |append_#in~head.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|))), 10047#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (and (= 0 append_~node~0.offset) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))) (= append_~head.base append_~node~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= append_~head.offset 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 10:05:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:05:48,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:05:48,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:05:48,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:05:48,391 INFO L87 Difference]: Start difference. First operand 209 states and 225 transitions. Second operand 30 states. [2018-02-02 10:05:49,042 WARN L143 SmtUtils]: Spent 446ms on a formula simplification that was a NOOP. DAG size: 122 [2018-02-02 10:05:49,754 WARN L143 SmtUtils]: Spent 406ms on a formula simplification that was a NOOP. DAG size: 127 [2018-02-02 10:05:51,005 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 91 DAG size of output 71 [2018-02-02 10:05:51,913 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 98 DAG size of output 72 [2018-02-02 10:05:52,444 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 124 DAG size of output 65 [2018-02-02 10:05:52,636 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 85 DAG size of output 68 [2018-02-02 10:05:52,827 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 108 DAG size of output 65 [2018-02-02 10:05:53,013 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 109 DAG size of output 66 [2018-02-02 10:05:53,208 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 113 DAG size of output 72 [2018-02-02 10:05:53,523 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 112 DAG size of output 68 [2018-02-02 10:05:53,734 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 94 DAG size of output 77 [2018-02-02 10:05:54,471 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 85 DAG size of output 59 [2018-02-02 10:05:55,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:55,796 INFO L93 Difference]: Finished difference Result 293 states and 314 transitions. [2018-02-02 10:05:55,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:05:55,796 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 76 [2018-02-02 10:05:55,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:55,797 INFO L225 Difference]: With dead ends: 293 [2018-02-02 10:05:55,797 INFO L226 Difference]: Without dead ends: 293 [2018-02-02 10:05:55,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=474, Invalid=3558, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 10:05:55,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-02 10:05:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 214. [2018-02-02 10:05:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 10:05:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 230 transitions. [2018-02-02 10:05:55,800 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 230 transitions. Word has length 76 [2018-02-02 10:05:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:55,801 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 230 transitions. [2018-02-02 10:05:55,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:05:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 230 transitions. [2018-02-02 10:05:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 10:05:55,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:55,801 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 10:05:55,801 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1170955849, now seen corresponding path program 2 times [2018-02-02 10:05:55,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:55,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-02 10:05:55,845 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:05:55,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:05:55,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:05:55,845 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 10:05:55,846 INFO L182 omatonBuilderFactory]: Interpolants [10642#true, 10643#false, 10644#(= main_~c~0 0), 10645#(<= main_~c~0 1), 10646#(<= main_~c~0 2)] [2018-02-02 10:05:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-02-02 10:05:55,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:05:55,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:05:55,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:05:55,846 INFO L87 Difference]: Start difference. First operand 214 states and 230 transitions. Second operand 5 states. [2018-02-02 10:05:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:05:55,870 INFO L93 Difference]: Finished difference Result 244 states and 258 transitions. [2018-02-02 10:05:55,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:05:55,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-02-02 10:05:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:05:55,871 INFO L225 Difference]: With dead ends: 244 [2018-02-02 10:05:55,871 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 10:05:55,871 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 10:05:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 10:05:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 225. [2018-02-02 10:05:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 10:05:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 246 transitions. [2018-02-02 10:05:55,873 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 246 transitions. Word has length 78 [2018-02-02 10:05:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:05:55,873 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 246 transitions. [2018-02-02 10:05:55,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:05:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 246 transitions. [2018-02-02 10:05:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:05:55,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:05:55,874 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 10:05:55,874 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:05:55,874 INFO L82 PathProgramCache]: Analyzing trace with hash -416484548, now seen corresponding path program 3 times [2018-02-02 10:05:55,874 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:05:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:05:55,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:05:57,555 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 79 DAG size of output 68 [2018-02-02 10:05:57,936 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 86 DAG size of output 77 [2018-02-02 10:05:58,987 WARN L146 SmtUtils]: Spent 246ms on a formula simplification. DAG size of input: 92 DAG size of output 83 [2018-02-02 10:05:59,653 WARN L143 SmtUtils]: Spent 376ms on a formula simplification that was a NOOP. DAG size: 113 [2018-02-02 10:06:00,926 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 79 DAG size of output 75 [2018-02-02 10:06:02,015 WARN L146 SmtUtils]: Spent 657ms on a formula simplification. DAG size of input: 110 DAG size of output 110 [2018-02-02 10:06:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 15 proven. 64 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:06:03,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:06:03,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 10:06:03,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:06:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:06:03,054 INFO L182 omatonBuilderFactory]: Interpolants [11136#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= append_~head.offset 0))) (= |#valid| |old(#valid)|) (= append_~head.base |append_#in~head.base|) (= |old(#length)| |#length|)), 11137#(and (= |#valid| (store |old(#valid)| |append_#t~malloc0.base| (select |#valid| |append_#t~malloc0.base|))) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= (store |old(#length)| |append_#t~malloc0.base| (select |#length| |append_#t~malloc0.base|)) |#length|) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 |append_#t~malloc0.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= append_~head.offset 0))) (= append_~head.base |append_#in~head.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|))), 11138#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (and (= append_~node~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= append_~head.offset 0))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11139#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= append_~head.base |append_#in~head.base|) (or (and (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= append_~node~0.offset 0) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (not (= append_~head.offset 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11140#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |#valid| |append_#in~head.base|) 1) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (or (and (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= append_~node~0.offset 0) (= append_~head.base |append_#in~head.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (not (= append_~head.offset 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11141#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |#valid| |append_#in~head.base|) 1) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (or (and (or (= |append_#t~mem12.offset| 0) (= |append_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= append_~head.base append_~node~0.base)) (= 0 append_~node~0.offset) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= append_~head.base |append_#in~head.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (not (= append_~head.offset 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11142#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= (select |#valid| |append_#in~head.base|) 1) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (or (and (= 0 append_~node~0.offset) (= |#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|)))) (= append_~head.base |append_#in~head.base|) (or (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (and (= append_~node~0.offset 0) (not (= (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4)) append_~node~0.offset))) (= (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) |append_#in~head.base|) (<= 9 (select |#length| (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|))) (= append_~head.base append_~node~0.base)) (or (<= 9 (select |#length| (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|))) (= (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|) |append_#in~head.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (and (or (and (= append_~node~0.offset 0) (not (= (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4)) append_~node~0.offset))) (= append_~head.base append_~node~0.base)) (or (= (select |#memory_$Pointer$.offset| append_~head.base) (select |old(#memory_$Pointer$.offset)| append_~head.base)) (= append_~node~0.base append_~head.base)))) (= |#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|))))) (not (= append_~head.offset 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11143#(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|)))) (= (select |#valid| |append_#in~head.base|) 1) (or (and (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ (- 0) 4)))) (= (select |#memory_$Pointer$.offset| |append_#in~head.base|) (store (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) 4 0))) (= |#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|)))) (<= 9 (select |#length| (@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~head.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|)))) (= (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)| |append_#in~head.base|)) (and (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ (- 0) 4)))) (= (select |#memory_$Pointer$.offset| |append_#in~head.base|) (store (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) 4 0))) (= 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|))) (= (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~head.base|) (<= 9 (select |#length| (@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|)))) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ (- 0) 4)))) (= (select |#memory_$Pointer$.offset| |append_#in~head.base|) (store (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) 4 0))) (= (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|))) (<= 9 (select |#length| (@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~head.base|)) (or (<= 9 (select |#length| (@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|))) (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ (- 0) 4)))) (= (select |#memory_$Pointer$.offset| |append_#in~head.base|) (store (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) 4 0))) (= (@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~head.base|) (= 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|))))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ (- 0) 4))) (= (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 (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ (- 0) 4)))) (= (select |#memory_$Pointer$.offset| |append_#in~head.base|) (store (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) 4 0))) (<= 9 (select |#length| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~head.base|) (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) (+ (- 0) 4)))) (= (select |#memory_$Pointer$.offset| |append_#in~head.base|) (store (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) 4 0))) (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (<= 9 (select |#length| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (not (= |append_#in~head.offset| 0))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11144#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= |#valid| |old(#valid)|) (or (and (= append_~head.base |append_#in~head.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= append_~head.offset 0))) (= |old(#length)| |#length|)), 11145#(and (= |#valid| (store |old(#valid)| |append_#t~malloc0.base| (select |#valid| |append_#t~malloc0.base|))) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= (store |old(#length)| |append_#t~malloc0.base| (select |#length| |append_#t~malloc0.base|)) |#length|) (or (and (= append_~head.base |append_#in~head.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= append_~head.offset 0))) (= 0 (select |old(#valid)| |append_#t~malloc0.base|))), 11146#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (and (or (and (= |append_#in~head.base| append_~head.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= append_~head.base append_~node~0.base)) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= append_~head.base append_~node~0.base)))) (not (= append_~head.offset 0))) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11147#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (or (and (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= append_~head.base append_~node~0.base))) (or (and (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= |append_#in~head.base| append_~head.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (= append_~head.base append_~node~0.base))) (not (= append_~head.offset 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11148#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (or (and (or (and (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= |append_#in~head.base| append_~head.base) (= |append_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (= append_~head.base append_~node~0.base)) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= append_~head.base append_~node~0.base)))) (not (= append_~head.offset 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11149#(and (= 0 (select |old(#valid)| append_~node~0.base)) (or (and (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (not (= append_~head.base append_~node~0.base))) (or (and (= |#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|)))) (= |append_#in~head.base| append_~head.base) (or (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (not (= (select |#length| (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|)) 8)) (not (= (select (select |old(#memory_$Pointer$.offset)| append_~head.base) (+ append_~head.offset 4)) 0))) (or (not (= (select |#length| (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|)) 8)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (not (= (select (select |old(#memory_$Pointer$.offset)| append_~head.base) (+ append_~head.offset 4)) 0))) (= |#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|))))) (= append_~head.base append_~node~0.base))) (not (= append_~head.offset 0))) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (or (= append_~node~0.base (@diff |old(#length)| |#length|)) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= append_~node~0.base (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11150#(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|)))) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (or (= (@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~head.base|) (= 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|)))) (not (= (select |#length| (@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|)) 8)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) 0))) (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|))) (not (= (select |#length| (@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|)) 8)) (= (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|) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) 0)) (= (@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~head.base|)) (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|)))) (= (@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~head.base|) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) 0)) (= 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|))) (not (= (select |#length| (@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|)) 8))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~head.base|) (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (not (= (select |#length| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) 8)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) 0))) (= (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 (= (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|))) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) 0)) (not (= (select |#length| (@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|)) 8)) (= (@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~head.base|)) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~head.base|) (not (= (select |#length| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) 8)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~head.base|) (+ (- 0) 4)) 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.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|)) (not (= |append_#in~head.offset| 0))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11151#(and (= 0 (select (select |#memory_$Pointer$.base| main_~list2~0.base) main_~list2~0.offset)) (not (= (select |#valid| main_~list2~0.base) 0)) (not (= (select |#length| main_~list2~0.base) 9)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list2~0.base) main_~list2~0.offset))), 11152#(and (not (= (select |#length| |append_#in~head.base|) 9)) (not (= (select |#valid| |append_#in~head.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) |append_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |append_#in~head.base|) |append_#in~head.offset|))), 11153#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (not (= (select |#length| append_~head.base) 9)) (not (= (select |#valid| append_~head.base) 0)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) append_~head.offset))), 11154#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) append_~head.offset)) (not (= append_~head.base |append_#t~malloc0.base|))), 11155#(and (= 0 (select (select |#memory_$Pointer$.base| append_~head.base) append_~head.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~head.base) append_~head.offset)) (not (= append_~head.base append_~node~0.base))), 11156#(and (not (= append_~head.base append_~node~0.base)) (= |append_#t~mem2.base| 0) (= 0 |append_#t~mem2.offset|)), 11157#(and (not (= append_~head.base append_~node~0.base)) |append_#t~short4|), 11116#true, 11117#false, 11118#(and (= 8 (select |#length| |main_#t~malloc15.base|)) (= (select |#valid| |main_#t~malloc15.base|) 1) (= 0 |main_#t~malloc15.offset|)), 11119#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base)) (= (select |#valid| main_~list~0.base) 1)), 11120#(and (= (select |#valid| |main_#t~malloc18.base|) 1) (= (select |#length| |main_#t~malloc18.base|) (select |#length| main_~list~0.base)) (not (= main_~list~0.base |main_#t~malloc18.base|)) (= 0 main_~list~0.offset) (= 8 (select |#length| |main_#t~malloc18.base|)) (= (select |#valid| main_~list~0.base) 1)), 11121#(and (not (= main_~list~0.base main_~list2~0.base)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list2~0.base) 1) (= 8 (select |#length| main_~list2~0.base)) (= (select |#length| main_~list2~0.base) (select |#length| main_~list~0.base)) (= (select |#valid| main_~list~0.base) 1)), 11122#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list2~0.base) (+ main_~list2~0.offset 4) 0) main_~list2~0.offset)) (not (= main_~list~0.base main_~list2~0.base)) (= 0 main_~list~0.offset) (= (select |#valid| main_~list2~0.base) 1) (= 8 (select |#length| main_~list2~0.base)) (= (select |#length| main_~list2~0.base) (select |#length| main_~list~0.base)) (= (select |#valid| main_~list~0.base) 1) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list2~0.base) (+ main_~list2~0.offset 4) 0) main_~list2~0.offset))), 11123#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11124#(and (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= |#valid| |old(#valid)|) (= append_~head.base |append_#in~head.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11125#(and (= |#valid| (store |old(#valid)| |append_#t~malloc0.base| (select |#valid| |append_#t~malloc0.base|))) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= (store |old(#length)| |append_#t~malloc0.base| (select |#length| |append_#t~malloc0.base|)) |#length|) (= append_~head.base |append_#in~head.base|) (or (= 0 |append_#t~malloc0.offset|) (not (= append_~head.offset 0))) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11126#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= append_~node~0.offset 0) (not (= append_~head.offset 0))) (= append_~head.base |append_#in~head.base|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#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|))))), 11127#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= append_~node~0.offset 0) (not (= append_~head.offset 0))) (= append_~head.base |append_#in~head.base|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11128#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (and (= append_~node~0.offset 0) (= 1 (select |#valid| append_~head.base))) (not (= append_~head.offset 0))) (= append_~head.base |append_#in~head.base|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11129#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= append_~head.base |append_#in~head.base|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (or (and (= append_~node~0.offset 0) (= (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4)) |append_#t~mem3.offset|) (= (select |#valid| append_~head.base) 1)) (not (= append_~head.offset 0))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11130#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= append_~head.base |append_#in~head.base|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (or (and (or (not |append_#t~short4|) (and (= append_~node~0.offset 0) (= (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4)) append_~node~0.offset))) (= (select |#valid| append_~head.base) 1)) (not (= append_~head.offset 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11131#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= append_~head.base |append_#in~head.base|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (or (and (= append_~node~0.offset 0) (= (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4)) append_~node~0.offset) (= (select |#valid| append_~head.base) 1)) (not (= append_~head.offset 0))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11132#(and (= |#memory_$Pointer$.offset| (store (store |old(#memory_$Pointer$.offset)| append_~head.base (select |#memory_$Pointer$.offset| append_~head.base)) append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base))) (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= 0 (select |old(#valid)| append_~node~0.base)) (or (= |append_#in~head.offset| append_~head.offset) (= append_~head.offset 0)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| append_~head.base (select |#memory_$Pointer$.base| append_~head.base)) append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base))) (= append_~head.base |append_#in~head.base|) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (or (and (= append_~node~0.offset 0) (= (select (store (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4) append_~node~0.offset) (+ append_~head.offset 4)) (select (select |#memory_$Pointer$.offset| append_~head.base) (+ append_~head.offset 4))) (= (select |#valid| append_~head.base) 1)) (not (= append_~head.offset 0))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11133#(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|)))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (or (= (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) (= (@diff (store |old(#memory_$Pointer$.offset)| append_~node~0.base (select |#memory_$Pointer$.offset| append_~node~0.base)) |#memory_$Pointer$.offset|) |append_#in~head.base|)) (= 0 (select |old(#valid)| append_~node~0.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 (= (@diff (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)) |#memory_$Pointer$.base|) |append_#in~head.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~node~0.base (select |#memory_$Pointer$.base| append_~node~0.base)))) (or (not (= |append_#in~head.offset| 0)) (and (= (select |#valid| |append_#in~head.base|) 1) (= (select (select (store |#memory_$Pointer$.offset| append_~node~0.base (store (select |#memory_$Pointer$.offset| append_~node~0.base) (+ append_~node~0.offset 1) 0)) |append_#in~head.base|) 4) 0))) (= |#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|)))))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11134#(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|)))) (or (= 0 (select |old(#valid)| |append_#in~head.base|)) (and (= (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|) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~head.base|) (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#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 (= (@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~head.base|) (= 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|))))) (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |append_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (or (and (= (select (select |#memory_$Pointer$.offset| |append_#in~head.base|) 4) 0) (= (select |#valid| |append_#in~head.base|) 1)) (not (= |append_#in~head.offset| 0))) (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|))) (= (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~head.base|)))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 11135#(and (not (= main_~list~0.base main_~list2~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~list2~0.base) main_~list2~0.offset)) (not (= (select |#valid| main_~list2~0.base) 0)) (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list2~0.base)) (not (= (select |#valid| main_~list~0.base) 0)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~list2~0.base) main_~list2~0.offset)))] [2018-02-02 10:06:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 15 proven. 64 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:06:03,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 10:06:03,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 10:06:03,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:06:03,055 INFO L87 Difference]: Start difference. First operand 225 states and 246 transitions. Second operand 42 states. [2018-02-02 10:06:03,977 WARN L143 SmtUtils]: Spent 400ms on a formula simplification that was a NOOP. DAG size: 118 [2018-02-02 10:06:04,948 WARN L143 SmtUtils]: Spent 350ms on a formula simplification that was a NOOP. DAG size: 125 [2018-02-02 10:06:06,452 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 147 DAG size of output 54 [2018-02-02 10:06:06,918 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 181 DAG size of output 59 [2018-02-02 10:06:08,256 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 178 DAG size of output 59 [2018-02-02 10:06:08,734 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 165 DAG size of output 57 [2018-02-02 10:06:09,472 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 176 DAG size of output 65 [2018-02-02 10:06:09,872 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 99 DAG size of output 80 [2018-02-02 10:06:10,115 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 105 DAG size of output 84 [2018-02-02 10:06:10,377 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 172 DAG size of output 74 [2018-02-02 10:06:10,798 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 181 DAG size of output 65 [2018-02-02 10:06:11,606 WARN L146 SmtUtils]: Spent 442ms on a formula simplification. DAG size of input: 184 DAG size of output 102 [2018-02-02 10:06:12,752 WARN L146 SmtUtils]: Spent 302ms on a formula simplification. DAG size of input: 100 DAG size of output 94 [2018-02-02 10:06:13,912 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 105 DAG size of output 75 [2018-02-02 10:06:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:06:14,018 INFO L93 Difference]: Finished difference Result 246 states and 267 transitions. [2018-02-02 10:06:14,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:06:14,018 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2018-02-02 10:06:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:06:14,019 INFO L225 Difference]: With dead ends: 246 [2018-02-02 10:06:14,019 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 10:06:14,020 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1427 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=672, Invalid=5490, Unknown=0, NotChecked=0, Total=6162 [2018-02-02 10:06:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 10:06:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 223. [2018-02-02 10:06:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 10:06:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 243 transitions. [2018-02-02 10:06:14,023 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 243 transitions. Word has length 96 [2018-02-02 10:06:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:06:14,023 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 243 transitions. [2018-02-02 10:06:14,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 10:06:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 243 transitions. [2018-02-02 10:06:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 10:06:14,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:06:14,024 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 10:06:14,024 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 10:06:14,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1551576191, now seen corresponding path program 4 times [2018-02-02 10:06:14,024 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:06:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:06:14,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:06:15,986 WARN L146 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 81 DAG size of output 74 [2018-02-02 10:06:16,400 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 86 DAG size of output 82 Received shutdown request... [2018-02-02 10:06:17,422 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:06:17,426 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:06:17,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:06:17 BoogieIcfgContainer [2018-02-02 10:06:17,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:06:17,427 INFO L168 Benchmark]: Toolchain (without parser) took 57673.06 ms. Allocated memory was 403.7 MB in the beginning and 1.2 GB in the end (delta: 768.1 MB). Free memory was 360.6 MB in the beginning and 883.5 MB in the end (delta: -522.9 MB). Peak memory consumption was 245.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:06:17,428 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:06:17,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.20 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 349.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:06:17,429 INFO L168 Benchmark]: Boogie Preprocessor took 29.08 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 347.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:06:17,429 INFO L168 Benchmark]: RCFGBuilder took 388.32 ms. Allocated memory is still 403.7 MB. Free memory was 347.2 MB in the beginning and 311.6 MB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:06:17,429 INFO L168 Benchmark]: TraceAbstraction took 57064.34 ms. Allocated memory was 403.7 MB in the beginning and 1.2 GB in the end (delta: 768.1 MB). Free memory was 311.6 MB in the beginning and 883.5 MB in the end (delta: -571.9 MB). Peak memory consumption was 196.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:06:17,430 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.15 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 188.20 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 349.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.08 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 347.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 388.32 ms. Allocated memory is still 403.7 MB. Free memory was 347.2 MB in the beginning and 311.6 MB in the end (delta: 35.5 MB). Peak memory consumption was 35.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57064.34 ms. Allocated memory was 403.7 MB in the beginning and 1.2 GB in the end (delta: 768.1 MB). Free memory was 311.6 MB in the beginning and 883.5 MB in the end (delta: -571.9 MB). Peak memory consumption was 196.2 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 559). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 580). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 576). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 99 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 131 locations, 55 error locations. TIMEOUT Result, 57.0s OverallTime, 29 OverallIterations, 4 TraceHistogramMax, 34.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2337 SDtfs, 4895 SDslu, 13408 SDs, 0 SdLazy, 16472 SolverSat, 1114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 753 GetRequests, 85 SyntacticMatches, 61 SemanticMatches, 607 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5164 ImplicationChecksByTransitivity, 34.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 183/463 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 646 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 1294 NumberOfCodeBlocks, 1294 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1266 ConstructedInterpolants, 0 QuantifiedInterpolants, 2483265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 183/463 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/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-06-17-436.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-06-17-436.csv Completed graceful shutdown