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/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:09:45,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:09:45,023 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:09:45,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:09:45,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:09:45,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:09:45,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:09:45,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:09:45,040 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:09:45,041 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:09:45,041 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:09:45,042 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:09:45,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:09:45,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:09:45,044 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:09:45,046 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:09:45,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:09:45,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:09:45,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:09:45,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:09:45,053 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:09:45,053 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:09:45,053 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:09:45,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:09:45,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:09:45,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:09:45,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:09:45,057 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:09:45,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:09:45,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:09:45,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:09:45,058 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:09:45,067 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:09:45,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:09:45,068 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:09:45,068 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:09:45,068 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:09:45,069 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:09:45,069 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:09:45,069 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:09:45,069 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:09:45,069 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:09:45,069 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:09:45,069 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:09:45,069 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:09:45,069 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:09:45,069 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:09:45,070 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:09:45,070 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:09:45,070 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:09:45,070 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:09:45,070 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:09:45,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:09:45,070 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:09:45,070 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:09:45,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:09:45,107 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:09:45,110 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:09:45,111 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:09:45,111 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:09:45,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-02-02 10:09:45,246 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:09:45,248 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:09:45,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:09:45,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:09:45,254 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:09:45,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:09:45" (1/1) ... [2018-02-02 10:09:45,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27487fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:45, skipping insertion in model container [2018-02-02 10:09:45,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:09:45" (1/1) ... [2018-02-02 10:09:45,271 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:09:45,298 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:09:45,380 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:09:45,391 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:09:45,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:45 WrapperNode [2018-02-02 10:09:45,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:09:45,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:09:45,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:09:45,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:09:45,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:45" (1/1) ... [2018-02-02 10:09:45,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:45" (1/1) ... [2018-02-02 10:09:45,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:45" (1/1) ... [2018-02-02 10:09:45,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:45" (1/1) ... [2018-02-02 10:09:45,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:45" (1/1) ... [2018-02-02 10:09:45,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:45" (1/1) ... [2018-02-02 10:09:45,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:45" (1/1) ... [2018-02-02 10:09:45,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:09:45,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:09:45,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:09:45,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:09:45,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:45" (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:09:45,459 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:09:45,460 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:09:45,460 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 10:09:45,460 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:09:45,460 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:09:45,460 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:09:45,460 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:09:45,460 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:09:45,460 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:09:45,460 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:09:45,460 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:09:45,460 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:09:45,461 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 10:09:45,461 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:09:45,461 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:09:45,461 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:09:45,755 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:09:45,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:09:45 BoogieIcfgContainer [2018-02-02 10:09:45,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:09:45,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:09:45,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:09:45,757 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:09:45,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:09:45" (1/3) ... [2018-02-02 10:09:45,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708a0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:09:45, skipping insertion in model container [2018-02-02 10:09:45,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:09:45" (2/3) ... [2018-02-02 10:09:45,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708a0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:09:45, skipping insertion in model container [2018-02-02 10:09:45,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:09:45" (3/3) ... [2018-02-02 10:09:45,760 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-02-02 10:09:45,766 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:09:45,771 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-02-02 10:09:45,798 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:09:45,798 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:09:45,798 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:09:45,799 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:09:45,799 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:09:45,799 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:09:45,799 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:09:45,799 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:09:45,800 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:09:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states. [2018-02-02 10:09:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:09:45,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:45,823 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:45,823 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2046659462, now seen corresponding path program 1 times [2018-02-02 10:09:45,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:45,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:45,933 INFO 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:09:45,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:45,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:09:45,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:45,936 INFO 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:09:45,937 INFO L182 omatonBuilderFactory]: Interpolants [107#true, 108#false, 109#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 10:09:45,937 INFO 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:09:45,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:09:45,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:09:45,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:09:45,948 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 3 states. [2018-02-02 10:09:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:46,117 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-02-02 10:09:46,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:09:46,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:09:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:46,127 INFO L225 Difference]: With dead ends: 109 [2018-02-02 10:09:46,127 INFO L226 Difference]: Without dead ends: 106 [2018-02-02 10:09:46,128 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:09:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-02 10:09:46,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2018-02-02 10:09:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 10:09:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-02-02 10:09:46,159 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 7 [2018-02-02 10:09:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:46,160 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-02-02 10:09:46,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:09:46,160 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-02-02 10:09:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 10:09:46,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:46,161 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:46,161 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2046659463, now seen corresponding path program 1 times [2018-02-02 10:09:46,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:46,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:46,208 INFO 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:09:46,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:46,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:09:46,208 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:46,208 INFO 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:09:46,209 INFO L182 omatonBuilderFactory]: Interpolants [320#true, 321#false, 322#(and (= (select |#length| |main_~#list~0.base|) 4) (= |main_~#list~0.offset| 0))] [2018-02-02 10:09:46,209 INFO 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:09:46,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:09:46,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:09:46,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:09:46,210 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 3 states. [2018-02-02 10:09:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:46,284 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-02-02 10:09:46,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:09:46,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 10:09:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:46,285 INFO L225 Difference]: With dead ends: 102 [2018-02-02 10:09:46,285 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 10:09:46,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:09:46,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 10:09:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-02-02 10:09:46,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 10:09:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-02-02 10:09:46,293 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 7 [2018-02-02 10:09:46,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:46,293 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-02-02 10:09:46,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:09:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-02-02 10:09:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:09:46,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:46,294 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:46,294 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash -190938367, now seen corresponding path program 1 times [2018-02-02 10:09:46,295 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:46,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:46,374 INFO 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:09:46,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:46,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:09:46,374 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:46,374 INFO 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:09:46,374 INFO L182 omatonBuilderFactory]: Interpolants [528#(= 1 (select |#valid| |append_#in~plist.base|)), 529#(= (select |#valid| append_~plist.base) 1), 525#true, 526#false, 527#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 10:09:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:46,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:09:46,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:09:46,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:09:46,376 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 5 states. [2018-02-02 10:09:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:46,505 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-02-02 10:09:46,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:09:46,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:09:46,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:46,507 INFO L225 Difference]: With dead ends: 96 [2018-02-02 10:09:46,507 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 10:09:46,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:09:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 10:09:46,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-02-02 10:09:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 10:09:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-02 10:09:46,513 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 14 [2018-02-02 10:09:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:46,513 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-02 10:09:46,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:09:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-02 10:09:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:09:46,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:46,514 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:46,514 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash -190938366, now seen corresponding path program 1 times [2018-02-02 10:09:46,515 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:46,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:46,631 INFO 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:09:46,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:46,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:09:46,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:46,632 INFO 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:09:46,632 INFO L182 omatonBuilderFactory]: Interpolants [721#true, 722#false, 723#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 724#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4) (= (select |#valid| |main_~#list~0.base|) 1)), 725#(and (= (select |#valid| |append_#in~plist.base|) 1) (<= 4 (select |#length| |append_#in~plist.base|)) (= 0 |append_#in~plist.offset|)), 726#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)) (= (select |#valid| append_~plist.base) 1)), 727#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)))] [2018-02-02 10:09:46,632 INFO 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:09:46,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:09:46,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:09:46,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:09:46,633 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 7 states. [2018-02-02 10:09:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:46,799 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-02-02 10:09:46,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:09:46,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 10:09:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:46,800 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:09:46,800 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 10:09:46,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:09:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 10:09:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2018-02-02 10:09:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 10:09:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-02-02 10:09:46,805 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 14 [2018-02-02 10:09:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:46,806 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-02-02 10:09:46,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:09:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-02-02 10:09:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:09:46,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:46,806 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:46,806 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:46,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1624122010, now seen corresponding path program 1 times [2018-02-02 10:09:46,807 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:46,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:46,843 INFO 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:09:46,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:46,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:09:46,843 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:46,844 INFO 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:09:46,844 INFO L182 omatonBuilderFactory]: Interpolants [966#true, 967#false, 968#(= 1 (select |#valid| |append_#t~malloc1.base|)), 969#(= 1 (select |#valid| append_~item~0.base))] [2018-02-02 10:09:46,844 INFO 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:09:46,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:09:46,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:09:46,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:09:46,845 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 4 states. [2018-02-02 10:09:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:46,895 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2018-02-02 10:09:46,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:09:46,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:09:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:46,896 INFO L225 Difference]: With dead ends: 109 [2018-02-02 10:09:46,896 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 10:09:46,897 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:09:46,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 10:09:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-02 10:09:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-02 10:09:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2018-02-02 10:09:46,901 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 15 [2018-02-02 10:09:46,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:46,901 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2018-02-02 10:09:46,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:09:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2018-02-02 10:09:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:09:46,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:46,902 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:46,902 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:46,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1624122009, now seen corresponding path program 1 times [2018-02-02 10:09:46,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:46,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:09:46,941 INFO 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:09:46,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:46,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:09:46,941 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:46,941 INFO 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:09:46,942 INFO L182 omatonBuilderFactory]: Interpolants [1190#true, 1191#false, 1192#(and (= 8 (select |#length| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|)), 1193#(and (= (select |#length| append_~item~0.base) 8) (= append_~item~0.offset 0))] [2018-02-02 10:09:46,942 INFO 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:09:46,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:09:46,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:09:46,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:09:46,942 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 4 states. [2018-02-02 10:09:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:46,998 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-02-02 10:09:46,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:09:46,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 10:09:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:46,999 INFO L225 Difference]: With dead ends: 105 [2018-02-02 10:09:46,999 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 10:09:46,999 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:09:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 10:09:47,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-02-02 10:09:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 10:09:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-02-02 10:09:47,002 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 15 [2018-02-02 10:09:47,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:47,002 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-02-02 10:09:47,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:09:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-02-02 10:09:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:09:47,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:47,010 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:09:47,010 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash 146058220, now seen corresponding path program 1 times [2018-02-02 10:09:47,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:47,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:47,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:09:47,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:47,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:09:47,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:47,090 INFO 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:09:47,090 INFO L182 omatonBuilderFactory]: Interpolants [1408#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 1409#(and (= 0 (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 1410#(and (= 0 (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset))), 1411#(and (= 0 |append_#t~mem3.offset|) (= 0 |append_#t~mem3.base|)), 1412#(and (= 0 (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))), 1413#(and (= |append_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)) (= |append_#t~mem4.base| 0) (= 0 (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))), 1406#true, 1407#false] [2018-02-02 10:09:47,090 INFO 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:09:47,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:09:47,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:09:47,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:09:47,090 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 8 states. [2018-02-02 10:09:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:47,237 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2018-02-02 10:09:47,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:09:47,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-02 10:09:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:47,238 INFO L225 Difference]: With dead ends: 102 [2018-02-02 10:09:47,238 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 10:09:47,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:09:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 10:09:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-02-02 10:09:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 10:09:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-02-02 10:09:47,242 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 20 [2018-02-02 10:09:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:47,242 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-02-02 10:09:47,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:09:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-02-02 10:09:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:09:47,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:47,242 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:47,243 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:47,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1968454587, now seen corresponding path program 1 times [2018-02-02 10:09:47,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:47,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:47,341 INFO 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:09:47,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:47,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:09:47,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:47,341 INFO 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:09:47,342 INFO L182 omatonBuilderFactory]: Interpolants [1632#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 1633#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.offset 0) (= |append_#in~plist.offset| append_~plist.offset))), 1634#(or (<= 4 (select |#length| |append_#in~plist.base|)) (not (= |append_#in~plist.offset| 0))), 1635#(and (< 0 (+ |main_~#list~0.offset| 1)) (<= (+ |main_~#list~0.offset| 4) (select |#length| |main_~#list~0.base|))), 1630#true, 1631#false] [2018-02-02 10:09:47,342 INFO 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:09:47,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:09:47,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:09:47,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:09:47,342 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 6 states. [2018-02-02 10:09:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:47,480 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-02-02 10:09:47,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:09:47,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 10:09:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:47,481 INFO L225 Difference]: With dead ends: 115 [2018-02-02 10:09:47,481 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:09:47,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:09:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:09:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2018-02-02 10:09:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 10:09:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-02-02 10:09:47,484 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 30 [2018-02-02 10:09:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:47,484 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-02-02 10:09:47,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:09:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-02-02 10:09:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:09:47,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:47,485 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:47,485 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:47,485 INFO L82 PathProgramCache]: Analyzing trace with hash -892550082, now seen corresponding path program 1 times [2018-02-02 10:09:47,485 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:47,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:47,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:09:47,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:47,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:09:47,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:47,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:09:47,554 INFO L182 omatonBuilderFactory]: Interpolants [1858#true, 1859#false, 1860#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 1861#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 1862#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 1863#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 1864#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-02-02 10:09:47,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:09:47,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:09:47,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:09:47,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:09:47,555 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 7 states. [2018-02-02 10:09:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:47,719 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-02-02 10:09:47,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:09:47,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-02 10:09:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:47,720 INFO L225 Difference]: With dead ends: 117 [2018-02-02 10:09:47,720 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 10:09:47,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:09:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 10:09:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2018-02-02 10:09:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 10:09:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2018-02-02 10:09:47,723 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 31 [2018-02-02 10:09:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:47,723 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2018-02-02 10:09:47,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:09:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2018-02-02 10:09:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:09:47,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:47,724 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:47,725 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:47,725 INFO L82 PathProgramCache]: Analyzing trace with hash -892550081, now seen corresponding path program 1 times [2018-02-02 10:09:47,726 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:47,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:47,817 INFO 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:09:47,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:47,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:09:47,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:47,818 INFO 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:09:47,818 INFO L182 omatonBuilderFactory]: Interpolants [2096#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 2097#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (<= (+ append_~item~0.offset 8) (select |#length| append_~item~0.base))), 2098#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 2099#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 2100#(and (= |main_#t~mem13.offset| 0) (<= 8 (select |#length| |main_#t~mem13.base|))), 2092#true, 2093#false, 2094#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 2095#(and (= append_~plist.base |append_#in~plist.base|) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|))] [2018-02-02 10:09:47,818 INFO 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:09:47,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:09:47,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:09:47,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:09:47,819 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 9 states. [2018-02-02 10:09:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:47,978 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-02-02 10:09:47,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:09:47,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-02 10:09:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:47,979 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:09:47,979 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:09:47,979 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:09:47,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:09:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2018-02-02 10:09:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 10:09:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2018-02-02 10:09:47,981 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 31 [2018-02-02 10:09:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:47,981 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-02-02 10:09:47,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:09:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2018-02-02 10:09:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:09:47,982 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:47,982 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:47,982 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1281554978, now seen corresponding path program 1 times [2018-02-02 10:09:47,983 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:47,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:48,007 INFO 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:09:48,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:48,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:09:48,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:48,008 INFO 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:09:48,009 INFO L182 omatonBuilderFactory]: Interpolants [2338#true, 2339#false, 2340#(<= main_~length~0 0)] [2018-02-02 10:09:48,009 INFO 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:09:48,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:09:48,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:09:48,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:09:48,009 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 3 states. [2018-02-02 10:09:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:48,022 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-02-02 10:09:48,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:09:48,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-02-02 10:09:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:48,028 INFO L225 Difference]: With dead ends: 103 [2018-02-02 10:09:48,028 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 10:09:48,028 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:09:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 10:09:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-02-02 10:09:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 10:09:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-02-02 10:09:48,031 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 33 [2018-02-02 10:09:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:48,031 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-02-02 10:09:48,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:09:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-02-02 10:09:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:09:48,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:48,032 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:48,032 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:48,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1628442402, now seen corresponding path program 1 times [2018-02-02 10:09:48,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:48,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:48,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:48,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:09:48,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:48,154 INFO 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:09:48,154 INFO L182 omatonBuilderFactory]: Interpolants [2545#true, 2546#false, 2547#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 2548#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.offset 0) (= |append_#in~plist.offset| append_~plist.offset))), 2549#(and (or (<= 4 (select |#length| |append_#in~plist.base|)) (not (= |append_#in~plist.offset| 0))) (= (select |#valid| |append_#in~plist.base|) 1)), 2550#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (= (select |#valid| |main_~#list~0.base|) 1)), 2551#(and (= (select |#valid| |append_#in~plist.base|) 1) (<= 4 (select |#length| |append_#in~plist.base|)) (= 0 |append_#in~plist.offset|)), 2552#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)) (= (select |#valid| append_~plist.base) 1)), 2553#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)))] [2018-02-02 10:09:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:48,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:09:48,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:09:48,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:09:48,155 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 9 states. [2018-02-02 10:09:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:48,299 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-02-02 10:09:48,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:09:48,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-02 10:09:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:48,300 INFO L225 Difference]: With dead ends: 100 [2018-02-02 10:09:48,301 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 10:09:48,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:09:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 10:09:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-02-02 10:09:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 10:09:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-02-02 10:09:48,303 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 34 [2018-02-02 10:09:48,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:48,304 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-02-02 10:09:48,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:09:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-02-02 10:09:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:09:48,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:48,305 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] [2018-02-02 10:09:48,305 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:48,305 INFO L82 PathProgramCache]: Analyzing trace with hash 183041674, now seen corresponding path program 1 times [2018-02-02 10:09:48,306 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:48,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:48,340 INFO 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:09:48,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:48,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:09:48,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:48,341 INFO 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:09:48,341 INFO L182 omatonBuilderFactory]: Interpolants [2752#false, 2753#(= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 2754#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 2755#(= 1 (select |#valid| |main_#t~mem15.base|)), 2751#true] [2018-02-02 10:09:48,341 INFO 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:09:48,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:09:48,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:09:48,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:09:48,342 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 5 states. [2018-02-02 10:09:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:48,410 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-02-02 10:09:48,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:09:48,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:09:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:48,411 INFO L225 Difference]: With dead ends: 92 [2018-02-02 10:09:48,411 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:09:48,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:09:48,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:09:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-02-02 10:09:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 10:09:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-02-02 10:09:48,414 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 34 [2018-02-02 10:09:48,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:48,414 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-02-02 10:09:48,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:09:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-02-02 10:09:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:09:48,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:48,415 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] [2018-02-02 10:09:48,415 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:48,415 INFO L82 PathProgramCache]: Analyzing trace with hash 183041675, now seen corresponding path program 1 times [2018-02-02 10:09:48,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:48,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:48,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:48,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:09:48,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:48,568 INFO 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:09:48,568 INFO L182 omatonBuilderFactory]: Interpolants [2944#true, 2945#false, 2946#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 2947#(and (= append_~plist.base |append_#in~plist.base|) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 2948#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 2949#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (<= (+ append_~item~0.offset 8) (select |#length| append_~item~0.base))), 2950#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 2951#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 2952#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 2953#(and (<= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 2954#(and (<= 0 |main_#t~mem15.offset|) (<= (+ |main_#t~mem15.offset| 8) (select |#length| |main_#t~mem15.base|)))] [2018-02-02 10:09:48,568 INFO 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:09:48,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:09:48,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:09:48,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:09:48,569 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 11 states. [2018-02-02 10:09:48,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:48,814 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-02 10:09:48,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:09:48,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-02-02 10:09:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:48,815 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:09:48,816 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:09:48,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:09:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:09:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-02-02 10:09:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 10:09:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 94 transitions. [2018-02-02 10:09:48,818 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 94 transitions. Word has length 34 [2018-02-02 10:09:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:48,819 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 94 transitions. [2018-02-02 10:09:48,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:09:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 94 transitions. [2018-02-02 10:09:48,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:09:48,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:48,819 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:48,820 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:48,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1082481281, now seen corresponding path program 1 times [2018-02-02 10:09:48,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:48,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:48,866 INFO 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:09:48,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:48,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:09:48,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:48,867 INFO 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:09:48,867 INFO L182 omatonBuilderFactory]: Interpolants [3154#true, 3155#false, 3156#(= main_~length~0 0), 3157#(<= 1 main_~length~0)] [2018-02-02 10:09:48,867 INFO 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:09:48,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:09:48,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:09:48,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:09:48,868 INFO L87 Difference]: Start difference. First operand 91 states and 94 transitions. Second operand 4 states. [2018-02-02 10:09:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:48,887 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-02-02 10:09:48,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:09:48,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-02 10:09:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:48,889 INFO L225 Difference]: With dead ends: 90 [2018-02-02 10:09:48,889 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 10:09:48,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:09:48,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 10:09:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-02-02 10:09:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:09:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-02-02 10:09:48,892 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 35 [2018-02-02 10:09:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:48,892 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-02-02 10:09:48,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:09:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-02-02 10:09:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:09:48,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:48,893 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:48,893 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:48,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1379324610, now seen corresponding path program 1 times [2018-02-02 10:09:48,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:48,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:49,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:49,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 10:09:49,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:49,237 INFO L182 omatonBuilderFactory]: Interpolants [3337#true, 3338#false, 3339#(= (select |#valid| |main_~#list~0.base|) 1), 3340#(= |#valid| |old(#valid)|), 3341#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 3342#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 3343#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 3344#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= 0 |append_#t~malloc7.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 3345#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= 0 |append_#t~ite8.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 3346#(and (or (= append_~plist.base append_~item~0.base) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~plist.base (store (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset append_~item~0.offset)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 3347#(and (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 3348#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))), 3349#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 3350#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4))) (= |main_#t~mem15.offset| 0)), 3351#(= |main_#t~mem16.offset| 0)] [2018-02-02 10:09:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:49,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:09:49,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:09:49,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:09:49,238 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 15 states. [2018-02-02 10:09:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:49,677 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-02-02 10:09:49,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:09:49,677 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-02-02 10:09:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:49,678 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:09:49,678 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:09:49,679 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:09:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:09:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2018-02-02 10:09:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:09:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-02-02 10:09:49,682 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 35 [2018-02-02 10:09:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:49,682 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-02-02 10:09:49,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:09:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-02-02 10:09:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:09:49,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:49,688 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:49,688 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:49,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1379324611, now seen corresponding path program 1 times [2018-02-02 10:09:49,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:49,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:49,899 INFO 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:09:49,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:49,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 10:09:49,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:49,899 INFO 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:09:49,900 INFO L182 omatonBuilderFactory]: Interpolants [3616#(= 1 (select |#valid| |main_#t~mem16.base|)), 3602#true, 3603#false, 3604#(= (select |#valid| |main_~#list~0.base|) 1), 3605#(= |#valid| |old(#valid)|), 3606#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 3607#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 3608#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 3609#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| |append_#t~malloc7.base|)) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 3610#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= 1 (select |#valid| |append_#t~ite8.base|)) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 3611#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.base append_~item~0.base) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4))))) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 3612#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 3613#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))), 3614#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 3615#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))) (= |main_#t~mem15.offset| 0))] [2018-02-02 10:09:49,900 INFO 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:09:49,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:09:49,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:09:49,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:09:49,900 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 15 states. [2018-02-02 10:09:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:50,243 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-02-02 10:09:50,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:09:50,243 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-02-02 10:09:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:50,244 INFO L225 Difference]: With dead ends: 111 [2018-02-02 10:09:50,244 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 10:09:50,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:09:50,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 10:09:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2018-02-02 10:09:50,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:09:50,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2018-02-02 10:09:50,246 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 35 [2018-02-02 10:09:50,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:50,246 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2018-02-02 10:09:50,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:09:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-02-02 10:09:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:09:50,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:50,247 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] [2018-02-02 10:09:50,247 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:50,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1613943773, now seen corresponding path program 1 times [2018-02-02 10:09:50,247 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:50,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:50,608 INFO 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:09:50,608 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:50,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 10:09:50,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:50,609 INFO 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:09:50,609 INFO L182 omatonBuilderFactory]: Interpolants [3855#true, 3856#false, 3857#(= 1 (select |#valid| |main_~#list~0.base|)), 3858#(= |#valid| |old(#valid)|), 3859#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 3860#(and (= (select |old(#valid)| |append_#t~malloc1.base|) 0) (= append_~plist.base |append_#in~plist.base|) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 3861#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= (select |old(#valid)| |append_#in~plist.base|) 0)) (= append_~plist.offset |append_#in~plist.offset|)), 3862#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~plist.base)) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= (select |old(#valid)| |append_#in~plist.base|) 0)) (= append_~plist.offset |append_#in~plist.offset|)), 3863#(and (= append_~plist.base |append_#in~plist.base|) (not (= |append_#t~malloc7.base| |append_#in~plist.base|)) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= (select |old(#valid)| |append_#in~plist.base|) 0)) (= append_~plist.offset |append_#in~plist.offset|)), 3864#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (not (= |append_#t~ite8.base| |append_#in~plist.base|)))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (or (not (= append_~plist.base append_~item~0.base)) (and (= (select |old(#valid)| |append_#in~plist.base|) 0) (= append_~plist.base |append_#in~plist.base|)))), 3865#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (not (= (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)) |append_#in~plist.base|)))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (or (not (= append_~plist.base append_~item~0.base)) (and (= (select |old(#valid)| |append_#in~plist.base|) 0) (= append_~plist.base |append_#in~plist.base|)))), 3866#(and (= 1 (select |#valid| |append_#in~plist.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)) (or (= (select |old(#valid)| |append_#in~plist.base|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) |append_#in~plist.base|)))), 3867#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= 1 (select |#valid| |main_~#list~0.base|))), 3868#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))) (= 1 (select |#valid| |main_~#list~0.base|)) (= |main_#t~mem15.offset| 0)), 3869#(= 1 (select (store |#valid| |main_#t~mem16.base| 0) |main_~#list~0.base|))] [2018-02-02 10:09:50,609 INFO 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:09:50,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:09:50,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:09:50,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:09:50,610 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 15 states. [2018-02-02 10:09:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:51,122 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-02-02 10:09:51,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:09:51,122 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-02-02 10:09:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:51,123 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:09:51,123 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:09:51,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:09:51,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:09:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2018-02-02 10:09:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:09:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-02-02 10:09:51,129 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 37 [2018-02-02 10:09:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:51,129 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-02-02 10:09:51,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:09:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-02-02 10:09:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:09:51,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:51,130 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] [2018-02-02 10:09:51,130 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1507350608, now seen corresponding path program 1 times [2018-02-02 10:09:51,132 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:51,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:51,193 INFO 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:09:51,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:51,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:09:51,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:51,194 INFO 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:09:51,194 INFO L182 omatonBuilderFactory]: Interpolants [4144#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 4145#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)), 4146#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 4147#(= |main_#t~mem17.offset| 0), 4140#true, 4141#false, 4142#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 4143#(and (= append_~plist.base |append_#in~plist.base|) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|))] [2018-02-02 10:09:51,194 INFO 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:09:51,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:09:51,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:09:51,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:09:51,194 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 8 states. [2018-02-02 10:09:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:51,267 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-02-02 10:09:51,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:09:51,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 10:09:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:51,268 INFO L225 Difference]: With dead ends: 115 [2018-02-02 10:09:51,268 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:09:51,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:09:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:09:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 10:09:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:09:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-02 10:09:51,270 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 38 [2018-02-02 10:09:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:51,270 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-02 10:09:51,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:09:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-02 10:09:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:09:51,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:51,271 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] [2018-02-02 10:09:51,271 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:51,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1507350609, now seen corresponding path program 1 times [2018-02-02 10:09:51,271 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:51,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:51,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:51,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 10:09:51,586 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:51,586 INFO L182 omatonBuilderFactory]: Interpolants [4388#true, 4389#false, 4390#(and (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 4391#(and (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 4392#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 4393#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|)), 4394#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (not (= append_~item~0.base |append_#t~malloc7.base|)) (= append_~plist.offset |append_#in~plist.offset|)), 4395#(and (= append_~plist.base |append_#in~plist.base|) (not (= append_~item~0.base |append_#t~ite8.base|)) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 4396#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.base append_~item~0.base) (and (= append_~item~0.offset 0) (not (= append_~item~0.base (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))))) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 4397#(and (or (and (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))) (= |append_#in~plist.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)))), 4398#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 4399#(and (or (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 0 |main_#t~mem15.offset|) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem15.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 4400#(and (or (= 1 (select (store |#valid| |main_#t~mem16.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 4401#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 4402#(= 1 (select |#valid| |main_#t~mem17.base|))] [2018-02-02 10:09:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:51,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:09:51,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:09:51,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:09:51,587 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 15 states. [2018-02-02 10:09:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:52,059 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-02 10:09:52,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:09:52,059 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-02 10:09:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:52,059 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:09:52,059 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:09:52,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:09:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:09:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2018-02-02 10:09:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:09:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-02-02 10:09:52,061 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 38 [2018-02-02 10:09:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:52,062 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-02-02 10:09:52,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:09:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-02-02 10:09:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:09:52,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:52,062 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] [2018-02-02 10:09:52,062 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash 563388428, now seen corresponding path program 1 times [2018-02-02 10:09:52,063 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:52,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:52,203 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:52,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:09:52,203 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:52,203 INFO 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:09:52,204 INFO L182 omatonBuilderFactory]: Interpolants [4672#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 4673#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 4674#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 4675#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 4676#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))), 4677#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))) (= |append_#t~malloc1.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))), 4678#(or (= append_~item~0.base (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)))), 4679#(or (= 1 (select |#valid| |append_#t~mem3.base|)) (= append_~item~0.base |append_#t~mem3.base|)), 4680#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset))), 4681#(= 1 (select |#valid| |append_#t~mem5.base|)), 4670#true, 4671#false] [2018-02-02 10:09:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:52,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:09:52,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:09:52,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:09:52,204 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 12 states. [2018-02-02 10:09:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:52,431 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-02-02 10:09:52,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:09:52,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-02 10:09:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:52,432 INFO L225 Difference]: With dead ends: 115 [2018-02-02 10:09:52,432 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:09:52,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:09:52,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:09:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 10:09:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:09:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-02 10:09:52,436 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 40 [2018-02-02 10:09:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:52,436 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-02 10:09:52,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:09:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-02 10:09:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:09:52,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:52,437 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] [2018-02-02 10:09:52,437 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:52,437 INFO L82 PathProgramCache]: Analyzing trace with hash 563388429, now seen corresponding path program 1 times [2018-02-02 10:09:52,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:52,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:52,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:52,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:09:52,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:52,608 INFO 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:09:52,609 INFO L182 omatonBuilderFactory]: Interpolants [4928#true, 4929#false, 4930#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 4931#(and (= append_~plist.base |append_#in~plist.base|) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 4932#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 4933#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (<= (+ append_~item~0.offset 8) (select |#length| append_~item~0.base))), 4934#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 4935#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 4936#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) 1) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))) (= 0 (select (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset))), 4937#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))) (= 0 (select (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset))), 4938#(and (= 0 |append_#t~mem3.offset|) (<= 8 (select |#length| |append_#t~mem3.base|))), 4939#(and (= 0 (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)))), 4940#(and (= |append_#t~mem5.offset| 0) (<= 8 (select |#length| |append_#t~mem5.base|)))] [2018-02-02 10:09:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:52,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:09:52,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:09:52,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:09:52,610 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 13 states. [2018-02-02 10:09:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:52,972 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-02-02 10:09:52,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:09:52,974 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-02-02 10:09:52,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:52,974 INFO L225 Difference]: With dead ends: 114 [2018-02-02 10:09:52,974 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 10:09:52,975 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:09:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 10:09:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 10:09:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:09:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2018-02-02 10:09:52,977 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 40 [2018-02-02 10:09:52,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:52,977 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2018-02-02 10:09:52,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:09:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2018-02-02 10:09:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:09:52,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:52,977 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:09:52,977 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:52,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1159956241, now seen corresponding path program 1 times [2018-02-02 10:09:52,978 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:52,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:53,072 INFO 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:09:53,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:53,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:09:53,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:53,073 INFO L182 omatonBuilderFactory]: Interpolants [5200#(and (= (select |old(#valid)| |append_#t~malloc1.base|) 0) (= append_~plist.base |append_#in~plist.base|) (not (= |append_#t~malloc1.base| 0)) (= append_~plist.offset |append_#in~plist.offset|)), 5201#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= (select |old(#valid)| append_~item~0.base) 0) (not (= append_~item~0.base 0))), 5202#(and (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 0)), 5203#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_~#list~0.base|))), 5204#(and (not (= |main_#t~mem17.base| 0)) (not (= |main_~#list~0.base| |main_#t~mem17.base|)) (= 1 (select |#valid| |main_~#list~0.base|))), 5195#true, 5196#false, 5197#(= 1 (select |#valid| |main_~#list~0.base|)), 5198#(= |#valid| |old(#valid)|), 5199#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|))] [2018-02-02 10:09:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:53,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:09:53,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:09:53,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:09:53,073 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 10 states. [2018-02-02 10:09:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:53,239 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-02 10:09:53,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:09:53,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-02 10:09:53,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:53,240 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:09:53,240 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:09:53,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:09:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:09:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-02 10:09:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:09:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-02-02 10:09:53,242 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 40 [2018-02-02 10:09:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:53,242 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-02-02 10:09:53,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:09:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-02-02 10:09:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:09:53,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:53,243 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:53,243 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash -176636398, now seen corresponding path program 1 times [2018-02-02 10:09:53,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:53,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:53,279 INFO 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:09:53,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:53,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:09:53,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:53,280 INFO 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:09:53,280 INFO L182 omatonBuilderFactory]: Interpolants [5456#(<= main_~length~0 1), 5457#(<= main_~length~0 0), 5453#true, 5454#false, 5455#(= main_~length~0 0)] [2018-02-02 10:09:53,280 INFO 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:09:53,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:09:53,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:09:53,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:09:53,281 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 5 states. [2018-02-02 10:09:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:53,307 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-02-02 10:09:53,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:09:53,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-02 10:09:53,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:53,307 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:09:53,308 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:09:53,308 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:09:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:09:53,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2018-02-02 10:09:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:09:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2018-02-02 10:09:53,310 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 45 [2018-02-02 10:09:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:53,310 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-02-02 10:09:53,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:09:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-02-02 10:09:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:09:53,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:53,310 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:53,310 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:53,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2049912175, now seen corresponding path program 1 times [2018-02-02 10:09:53,311 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:53,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:54,186 INFO 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:09:54,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:09:54,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-02 10:09:54,187 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:54,187 INFO 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:09:54,187 INFO L182 omatonBuilderFactory]: Interpolants [5706#true, 5707#false, 5708#(= |#valid| |old(#valid)|), 5709#(= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|), 5710#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 5711#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (not (= |append_#t~malloc1.base| 0)) (= |old(#valid)| (store |#valid| |append_#t~malloc1.base| (select |old(#valid)| |append_#t~malloc1.base|))) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 5712#(and (or (not (= append_~plist.base append_~item~0.base)) (= append_~item~0.base |append_#in~plist.base|)) (or (and (or (= |#valid| |old(#valid)|) (= append_~item~0.base (@diff |#valid| |old(#valid)|))) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= |append_#in~plist.base| append_~plist.base) (= 0 (select |old(#valid)| append_~item~0.base))) (= append_~plist.base append_~item~0.base)) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0))), 5713#(and (or (not (= append_~plist.base append_~item~0.base)) (= append_~item~0.base |append_#in~plist.base|)) (= append_~item~0.offset 0) (or (= append_~plist.base append_~item~0.base) (and (= (select |#valid| |append_#in~plist.base|) 1) (or (= |#valid| |old(#valid)|) (= append_~item~0.base (@diff |#valid| |old(#valid)|))) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= |append_#in~plist.base| append_~plist.base) (= 0 (select |old(#valid)| append_~item~0.base)))) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0))), 5714#(and (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|))) (= append_~item~0.offset 0) (or (= append_~plist.base append_~item~0.base) (and (= (select |#valid| |append_#in~plist.base|) 1) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base) (= 0 (select |old(#valid)| append_~item~0.base)))) (not (= append_~item~0.base 0))), 5715#(and (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|))) (or (= append_~plist.base append_~item~0.base) (and (not (= 0 |append_#t~malloc7.base|)) (= (store (store |#valid| append_~item~0.base (select |old(#valid)| append_~item~0.base)) |append_#t~malloc7.base| (select |old(#valid)| |append_#t~malloc7.base|)) |old(#valid)|) (not (= |append_#in~plist.base| |append_#t~malloc7.base|)) (not (= append_~item~0.base |append_#t~malloc7.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base) (= 0 (select |old(#valid)| append_~item~0.base)) (= 0 (select |old(#valid)| |append_#t~malloc7.base|)))) (= append_~item~0.offset 0) (not (= append_~item~0.base 0))), 5716#(and (or (= append_~plist.base append_~item~0.base) (and (not (= |append_#in~plist.base| |append_#t~ite8.base|)) (not (= 0 |append_#t~ite8.base|)) (not (= append_~item~0.base |append_#t~ite8.base|)) (= 0 (select |old(#valid)| |append_#t~ite8.base|)) (= (store (store |#valid| append_~item~0.base (select |old(#valid)| append_~item~0.base)) |append_#t~ite8.base| (select |old(#valid)| |append_#t~ite8.base|)) |old(#valid)|) (= |append_#in~plist.base| append_~plist.base) (= 0 (select |old(#valid)| append_~item~0.base)))) (or (not (= append_~plist.base append_~item~0.base)) (= append_~item~0.base |append_#in~plist.base|)) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0))), 5717#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (= append_~plist.base append_~item~0.base) (and (not (= |append_#in~plist.base| (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (not (= 0 (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= 0 (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= |old(#valid)| (store (store |#valid| append_~item~0.base (select |old(#valid)| append_~item~0.base)) (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)) (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4))))) (not (= append_~item~0.base (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= 0 (select |old(#valid)| append_~item~0.base)))) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0))), 5718#(and (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.base|) (and (= (store (store |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (not (= |append_#in~plist.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)))))), 5719#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 5720#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 4) 0) |old(#valid)|) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 5721#(and (or (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem15.offset| 0)) (or (not (= |main_#t~mem15.offset| 0)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))))), 5722#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (or (not (= 1 (select |#valid| |main_#t~mem16.base|))) (and (not (= |main_#t~mem16.base| |main_~#list~0.base|)) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) |main_#t~mem16.base| (select (store |#valid| |main_#t~mem16.base| 0) |main_#t~mem16.base|)) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem16.base|)))) (not (= 0 |main_#t~mem16.base|)))))), 5723#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 5724#(or (not (= 0 |main_#t~mem17.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= (store (store |#valid| |main_#t~mem17.base| (select (store |#valid| |main_#t~mem17.base| 0) |main_#t~mem17.base|)) |main_~#list~0.base| 0) |old(#valid)|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))), 5725#(or (= |old(#valid)| (store |#valid| |main_~#list~0.base| (select (store |#valid| |main_~#list~0.base| 0) |main_~#list~0.base|))) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))] [2018-02-02 10:09:54,187 INFO 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:09:54,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:09:54,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:09:54,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:09:54,188 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 20 states. [2018-02-02 10:09:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:55,412 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2018-02-02 10:09:55,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:09:55,413 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-02-02 10:09:55,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:55,413 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:09:55,413 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 10:09:55,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:09:55,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 10:09:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-02-02 10:09:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 10:09:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-02-02 10:09:55,416 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 47 [2018-02-02 10:09:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:55,416 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-02-02 10:09:55,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:09:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-02-02 10:09:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:09:55,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:55,417 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:09:55,417 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:55,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1188291934, now seen corresponding path program 1 times [2018-02-02 10:09:55,419 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:55,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:55,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:09:55,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:55,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:09:55,556 INFO L182 omatonBuilderFactory]: Interpolants [5989#true, 5990#false, 5991#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 5992#(and (= append_~plist.base |append_#in~plist.base|) (not (= |append_#t~malloc1.base| 0)) (= append_~plist.offset |append_#in~plist.offset|)), 5993#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0))), 5994#(not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) 0)), 5995#(not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)), 5996#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 5997#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|)), 5998#(and (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|)), 5999#(= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)), 6000#(and (= |append_#t~mem4.base| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))), 6001#(and (= 0 (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))), 6002#(= 0 (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))] [2018-02-02 10:09:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:55,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:09:55,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:09:55,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:09:55,557 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 14 states. [2018-02-02 10:09:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:55,828 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-02-02 10:09:55,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:09:55,828 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-02 10:09:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:55,828 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:09:55,828 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 10:09:55,829 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:09:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 10:09:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-02 10:09:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:09:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-02-02 10:09:55,830 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 55 [2018-02-02 10:09:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:55,830 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-02-02 10:09:55,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:09:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-02-02 10:09:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:09:55,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:55,831 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] [2018-02-02 10:09:55,831 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:55,831 INFO L82 PathProgramCache]: Analyzing trace with hash 579137738, now seen corresponding path program 1 times [2018-02-02 10:09:55,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:55,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:56,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:09:56,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:56,763 INFO 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:09:56,764 INFO L182 omatonBuilderFactory]: Interpolants [6218#true, 6219#false, 6220#(= (select |#valid| |main_~#list~0.base|) 1), 6221#(= |#valid| |old(#valid)|), 6222#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 6223#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 6224#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 6225#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= 0 |append_#t~malloc7.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 6226#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= 0 |append_#t~ite8.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 6227#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.base append_~item~0.base) (and (= (select |#valid| append_~item~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~plist.base (store (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset append_~item~0.offset)) append_~item~0.base) (+ append_~item~0.offset 4))))) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 6228#(and (= (select |#valid| |append_#in~plist.base|) 1) (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 6229#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= (select |#valid| |main_~#list~0.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 6230#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6231#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6232#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6233#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6234#(and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6235#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= (store |old(#memory_$Pointer$.offset)| append_~item~0.base (select |#memory_$Pointer$.offset| append_~item~0.base)) |#memory_$Pointer$.offset|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))), 6236#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (or (and (or (= append_~item~0.base |append_#t~mem5.base|) (= (select |#memory_$Pointer$.offset| |append_#t~mem5.base|) (select |old(#memory_$Pointer$.offset)| |append_#t~mem5.base|))) (= |append_#t~mem5.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= 0 (select |old(#valid)| append_~item~0.base))) (not (= |append_#t~mem5.offset| 0))) (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)) (= append_~plist.offset |append_#in~plist.offset|)), 6237#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~mem6.offset|)) (= 0 (select |old(#valid)| append_~item~0.base)))) (= append_~plist.offset |append_#in~plist.offset|)), 6238#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~ite8.offset|)) (= 0 (select |old(#valid)| append_~item~0.base)))) (= append_~plist.offset |append_#in~plist.offset|)), 6239#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (not (= append_~item~0.base append_~plist.base))) (or (= append_~item~0.base append_~plist.base) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) (select (select (store |#memory_$Pointer$.offset| append_~plist.base (store (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset append_~item~0.offset)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= 0 (select |old(#valid)| append_~item~0.base)))))) (= append_~plist.offset |append_#in~plist.offset|)), 6240#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)) (or (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 0 (select |old(#valid)| |append_#in~plist.base|)))), 6241#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))), 6242#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 6243#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4))) (= |main_#t~mem15.offset| 0)), 6244#(= |main_#t~mem16.offset| 0)] [2018-02-02 10:09:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:56,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:09:56,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:09:56,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:09:56,765 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 27 states. [2018-02-02 10:09:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:09:58,919 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2018-02-02 10:09:58,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 10:09:58,939 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2018-02-02 10:09:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:09:58,940 INFO L225 Difference]: With dead ends: 134 [2018-02-02 10:09:58,940 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 10:09:58,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=423, Invalid=3737, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 10:09:58,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 10:09:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 99. [2018-02-02 10:09:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:09:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-02-02 10:09:58,943 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 56 [2018-02-02 10:09:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:09:58,943 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-02-02 10:09:58,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:09:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-02-02 10:09:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:09:58,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:09:58,944 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] [2018-02-02 10:09:58,945 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:09:58,945 INFO L82 PathProgramCache]: Analyzing trace with hash 579137739, now seen corresponding path program 1 times [2018-02-02 10:09:58,945 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:09:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:09:58,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:09:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:59,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:09:59,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:09:59,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:09:59,852 INFO 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:09:59,852 INFO L182 omatonBuilderFactory]: Interpolants [6554#true, 6555#false, 6556#(= (select |#valid| |main_~#list~0.base|) 1), 6557#(= |#valid| |old(#valid)|), 6558#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 6559#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 6560#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 6561#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| |append_#t~malloc7.base|)) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 6562#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= 1 (select |#valid| |append_#t~ite8.base|)) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 6563#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.base append_~item~0.base) (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= (select |#valid| append_~item~0.base) 1))) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 6564#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= (select |#valid| |append_#in~plist.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 6565#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= (select |#valid| |main_~#list~0.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 6566#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6567#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6568#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#valid| (store |old(#valid)| |append_#t~malloc1.base| (select |#valid| |append_#t~malloc1.base|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6569#(and (= append_~plist.base |append_#in~plist.base|) (or (= |#valid| |old(#valid)|) (= append_~item~0.base (@diff |old(#valid)| |#valid|))) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6570#(and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (or (= |#valid| |old(#valid)|) (= append_~item~0.base (@diff |old(#valid)| |#valid|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6571#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6572#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= append_~item~0.offset 0) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6573#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (or (and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (or (= append_~item~0.base |append_#t~mem5.base|) (= (select |old(#memory_$Pointer$.base)| |append_#t~mem5.base|) (select |#memory_$Pointer$.base| |append_#t~mem5.base|))) (= |append_#t~mem5.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= |append_#t~mem5.offset| 0))) (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)) (= append_~plist.offset |append_#in~plist.offset|)), 6574#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (and (= |append_#t~mem6.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4)) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= 0 (select |old(#valid)| append_~item~0.base))))), 6575#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (and (= |append_#t~ite8.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4)) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= 0 (select |old(#valid)| append_~item~0.base))))), 6576#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= append_~item~0.base append_~plist.base) (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= 0 (select |old(#valid)| append_~item~0.base)))) (= append_~plist.offset |append_#in~plist.offset|)), 6577#(and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 0 (select |old(#valid)| |append_#in~plist.base|)))), 6578#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))), 6579#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 6580#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))) (= |main_#t~mem15.offset| 0)), 6581#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 10:09:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:09:59,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:09:59,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:09:59,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:09:59,853 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 28 states. [2018-02-02 10:10:01,137 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 105 DAG size of output 82 [2018-02-02 10:10:01,364 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 91 DAG size of output 75 [2018-02-02 10:10:02,994 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 73 DAG size of output 61 [2018-02-02 10:10:03,231 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 79 DAG size of output 65 [2018-02-02 10:10:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:03,246 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-02-02 10:10:03,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:10:03,246 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-02-02 10:10:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:03,247 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:10:03,247 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:10:03,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=429, Invalid=3731, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 10:10:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:10:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2018-02-02 10:10:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:10:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2018-02-02 10:10:03,249 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 56 [2018-02-02 10:10:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:03,249 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2018-02-02 10:10:03,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:10:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-02-02 10:10:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:10:03,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:03,250 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:10:03,250 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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:03,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1794381781, now seen corresponding path program 1 times [2018-02-02 10:10:03,251 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:03,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:03,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:03,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:10:03,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:03,966 INFO 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:10:03,966 INFO L182 omatonBuilderFactory]: Interpolants [6880#true, 6881#false, 6882#(= (select |#valid| |main_~#list~0.base|) 1), 6883#(= |#valid| |old(#valid)|), 6884#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 6885#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 6886#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 6887#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= (select |#valid| append_~plist.base) 1) (= append_~plist.offset |append_#in~plist.offset|)), 6888#(and (not (= append_~plist.base |append_#t~malloc7.base|)) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 6889#(and (not (= |append_#in~plist.base| |append_#t~ite8.base|)) (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 6890#(and (= append_~plist.base |append_#in~plist.base|) (or (and (not (= |append_#in~plist.base| (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= (select |#valid| append_~item~0.base) 1)) (= append_~plist.base append_~item~0.base)) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 6891#(and (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (and (not (= |append_#in~plist.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1))) (= (select |#valid| |append_#in~plist.base|) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 6892#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| |main_~#list~0.base|) 1) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 6893#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6894#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6895#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6896#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6897#(and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= 1 (select |#valid| append_~plist.base)) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6898#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~plist.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))), 6899#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~plist.base)) (or (and (or (= append_~item~0.base |append_#t~mem5.base|) (= (select |old(#memory_$Pointer$.base)| |append_#t~mem5.base|) (select |#memory_$Pointer$.base| |append_#t~mem5.base|))) (= |append_#t~mem5.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= 0 (select |old(#valid)| append_~item~0.base))) (not (= |append_#t~mem5.offset| 0))) (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)) (= append_~plist.offset |append_#in~plist.offset|)), 6900#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~plist.base)) (or (and (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~mem6.base|) (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset))) (= 0 (select |old(#valid)| append_~item~0.base))) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0))) (= append_~plist.offset |append_#in~plist.offset|)), 6901#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~plist.base)) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~ite8.base|)) (= 0 (select |old(#valid)| append_~item~0.base)))) (= append_~plist.offset |append_#in~plist.offset|)), 6902#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= append_~item~0.base append_~plist.base) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= 0 (select |old(#valid)| append_~item~0.base)))) (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (not (= append_~item~0.base append_~plist.base))))) (= 1 (select |#valid| append_~plist.base)) (= append_~plist.offset |append_#in~plist.offset|)), 6903#(and (= 1 (select |#valid| |append_#in~plist.base|)) (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 6904#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= 1 (select |#valid| |main_~#list~0.base|))), 6905#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))) (= 1 (select |#valid| |main_~#list~0.base|)) (= |main_#t~mem15.offset| 0)), 6906#(= 1 (select (store |#valid| |main_#t~mem16.base| 0) |main_~#list~0.base|))] [2018-02-02 10:10:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:03,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:10:03,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:10:03,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:10:03,967 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 27 states. [2018-02-02 10:10:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:05,837 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2018-02-02 10:10:05,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:10:05,837 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-02-02 10:10:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:05,837 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:10:05,837 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:10:05,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=424, Invalid=3236, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:10:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:10:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 101. [2018-02-02 10:10:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 10:10:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-02-02 10:10:05,840 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 58 [2018-02-02 10:10:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:05,840 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-02-02 10:10:05,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:10:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-02-02 10:10:05,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:10:05,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:05,841 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, 1] [2018-02-02 10:10:05,841 INFO L371 AbstractCegarLoop]: === Iteration 30 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:05,841 INFO L82 PathProgramCache]: Analyzing trace with hash 208739657, now seen corresponding path program 1 times [2018-02-02 10:10:05,842 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:05,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:06,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:06,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:10:06,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:06,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:10:06,709 INFO L182 omatonBuilderFactory]: Interpolants [7232#(= 1 (select |#valid| |main_#t~mem17.base|)), 7205#true, 7206#false, 7207#(= (select |#valid| |main_~#list~0.base|) 1), 7208#(= |#valid| |old(#valid)|), 7209#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 7210#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 7211#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 7212#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| |append_#t~malloc7.base|)) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 7213#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= 1 (select |#valid| |append_#t~ite8.base|)) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 7214#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.base append_~item~0.base) (and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= (select |#valid| append_~item~0.base) 1))) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 7215#(and (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 7216#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 7217#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7218#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7219#(and (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 1 (select |#valid| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7220#(and (= 1 (select |#valid| append_~item~0.base)) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7221#(and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= 1 (select |#valid| append_~item~0.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7222#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))), 7223#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.base)) (or (and (or (= append_~item~0.base |append_#t~mem5.base|) (= (select |old(#memory_$Pointer$.base)| |append_#t~mem5.base|) (select |#memory_$Pointer$.base| |append_#t~mem5.base|))) (= |append_#t~mem5.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= 0 (select |old(#valid)| append_~item~0.base))) (not (= |append_#t~mem5.offset| 0))) (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)) (= append_~plist.offset |append_#in~plist.offset|)), 7224#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= |append_#t~mem6.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4)) (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset))) (= 0 (select |old(#valid)| append_~item~0.base)))) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 7225#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= |append_#t~ite8.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4))) (= 0 (select |old(#valid)| append_~item~0.base)))) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 7226#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (or (= append_~item~0.base append_~plist.base) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4))) (= 0 (select |old(#valid)| append_~item~0.base)))) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 7227#(and (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (and (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= |append_#in~plist.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 7228#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7229#(and (= 0 |main_#t~mem15.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7230#(and (or (= 1 (select (store |#valid| |main_#t~mem16.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7231#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))] [2018-02-02 10:10:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:06,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:10:06,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:10:06,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:10:06,710 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 28 states. [2018-02-02 10:10:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:08,519 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-02-02 10:10:08,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:10:08,519 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 59 [2018-02-02 10:10:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:08,520 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:10:08,520 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:10:08,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=313, Invalid=2879, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 10:10:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:10:08,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2018-02-02 10:10:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 10:10:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-02-02 10:10:08,524 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 59 [2018-02-02 10:10:08,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:08,524 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-02-02 10:10:08,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:10:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-02-02 10:10:08,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:10:08,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:08,525 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, 1, 1, 1] [2018-02-02 10:10:08,525 INFO L371 AbstractCegarLoop]: === Iteration 31 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:08,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1264652791, now seen corresponding path program 1 times [2018-02-02 10:10:08,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:08,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:08,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:08,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:10:08,630 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:08,630 INFO 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:10:08,631 INFO L182 omatonBuilderFactory]: Interpolants [7520#(and (not (= |main_#t~mem17.base| 0)) (not (= |main_~#list~0.base| |main_#t~mem17.base|)) (= 1 (select |#valid| |main_~#list~0.base|))), 7509#true, 7510#false, 7511#(= append_~plist.base |append_#in~plist.base|), 7512#(= 1 (select |#valid| |append_#in~plist.base|)), 7513#(= 1 (select |#valid| |main_~#list~0.base|)), 7514#(= |#valid| |old(#valid)|), 7515#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 7516#(and (= (select |old(#valid)| |append_#t~malloc1.base|) 0) (= append_~plist.base |append_#in~plist.base|) (not (= |append_#t~malloc1.base| 0)) (= append_~plist.offset |append_#in~plist.offset|)), 7517#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= (select |old(#valid)| append_~item~0.base) 0) (not (= append_~item~0.base 0))), 7518#(and (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 0)), 7519#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_~#list~0.base|)))] [2018-02-02 10:10:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:08,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:10:08,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:10:08,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:10:08,631 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 12 states. [2018-02-02 10:10:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:08,768 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2018-02-02 10:10:08,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:10:08,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-02-02 10:10:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:08,769 INFO L225 Difference]: With dead ends: 101 [2018-02-02 10:10:08,769 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 10:10:08,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:10:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 10:10:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-02-02 10:10:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 10:10:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-02-02 10:10:08,771 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 61 [2018-02-02 10:10:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:08,771 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-02-02 10:10:08,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:10:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-02-02 10:10:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:10:08,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:08,772 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:08,772 INFO L371 AbstractCegarLoop]: === Iteration 32 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:08,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1335954918, now seen corresponding path program 1 times [2018-02-02 10:10:08,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:08,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:10,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:10,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:10:10,005 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:10,005 INFO 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:10:10,005 INFO L182 omatonBuilderFactory]: Interpolants [7744#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 7745#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|)), 7746#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (not (= append_~item~0.base |append_#t~malloc7.base|)) (= append_~plist.offset |append_#in~plist.offset|)), 7747#(and (= append_~plist.base |append_#in~plist.base|) (not (= append_~item~0.base |append_#t~ite8.base|)) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 7748#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.base append_~item~0.base) (not (= append_~item~0.base (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4))))) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|)), 7749#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1) (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 7750#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 7751#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7752#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7753#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (not (= |append_#t~malloc1.base| 0)) (= 0 |append_#t~malloc1.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7754#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (not (= append_~item~0.base 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7755#(and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (not (= append_~item~0.base 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7756#(and (= append_~plist.base |append_#in~plist.base|) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (not (= append_~item~0.base 0)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))), 7757#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (or (= append_~item~0.base |append_#t~mem5.base|) (= (select |old(#memory_$Pointer$.base)| |append_#t~mem5.base|) (select |#memory_$Pointer$.base| |append_#t~mem5.base|)) (not (= |append_#t~mem5.offset| 0))) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (= |append_#t~mem5.base| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (not (= append_~item~0.base 0))), 7758#(and (= append_~plist.base |append_#in~plist.base|) (= 0 append_~item~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset))) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~mem6.base|) (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (not (= append_~item~0.base 0))), 7759#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| append_~item~0.base) (+ append_~item~0.offset 4) |append_#t~ite8.base|) append_~item~0.offset))) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~ite8.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (not (= append_~item~0.base 0))), 7760#(and (or (= append_~item~0.base append_~plist.base) (and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) append_~item~0.offset))))) (or (= append_~item~0.base |append_#in~plist.base|) (not (= append_~item~0.base append_~plist.base))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (not (= append_~item~0.base 0))), 7761#(and (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)))) (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))) (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.base|))), 7762#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7763#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset|) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7764#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= 1 (select |#valid| |main_#t~mem14.base|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7765#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= 1 (select |#valid| main_~next~0.base))))), 7766#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem15.offset| 0) (= 1 (select |#valid| main_~next~0.base))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7767#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select (store |#valid| |main_#t~mem16.base| 0) main_~next~0.base))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7768#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| main_~next~0.base))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7769#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= 1 (select (store |#valid| |main_#t~mem17.base| 0) main_~next~0.base)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 7770#(or (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| main_~next~0.base))), 7771#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 7772#(= 1 (select |#valid| |main_#t~mem20.base|)), 7738#true, 7739#false, 7740#(= (select |#valid| |main_~#list~0.base|) 1), 7741#(= |#valid| |old(#valid)|), 7742#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 7743#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|))] [2018-02-02 10:10:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:10,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 10:10:10,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 10:10:10,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1100, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:10:10,006 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 35 states. [2018-02-02 10:10:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:12,237 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2018-02-02 10:10:12,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:10:12,237 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-02-02 10:10:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:12,237 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:10:12,237 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:10:12,238 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=386, Invalid=4444, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 10:10:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:10:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2018-02-02 10:10:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 10:10:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-02-02 10:10:12,240 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 66 [2018-02-02 10:10:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:12,240 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-02-02 10:10:12,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 10:10:12,240 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-02-02 10:10:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:10:12,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:12,241 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:12,241 INFO L371 AbstractCegarLoop]: === Iteration 33 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1335954917, now seen corresponding path program 1 times [2018-02-02 10:10:12,241 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:12,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:12,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:12,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:10:12,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:12,914 INFO 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:10:12,914 INFO L182 omatonBuilderFactory]: Interpolants [8096#(or (and (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.base|)) (and (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))) (or (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)))) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0))))), 8097#(or (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8098#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset|)))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8099#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 |main_#t~mem14.offset|) (<= 8 (select |#length| |main_#t~mem14.base|)))), 8100#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset))), 8101#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8102#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8103#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 8104#(and (<= 8 (select |#length| |main_#t~mem20.base|)) (= |main_#t~mem20.offset| 0)), 8081#true, 8082#false, 8083#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 8084#(and (= append_~plist.base |append_#in~plist.base|) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 8085#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 8086#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)), 8087#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 8088#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 8089#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8090#(and (= append_~plist.base |append_#in~plist.base|) (not (= |append_#t~malloc1.base| 0)) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8091#(and (or (not (= append_~item~0.base append_~plist.base)) (and (= append_~item~0.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0)))) (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))), 8092#(and (or (not (= append_~item~0.base append_~plist.base)) (and (= append_~item~0.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0)))) (or (= append_~item~0.base append_~plist.base) (and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))), 8093#(and (or (not (= append_~item~0.base append_~plist.base)) (and (= append_~item~0.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0)))) (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))))), 8094#(and (or (not (= append_~item~0.base append_~plist.base)) (and (= append_~item~0.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0)))) (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem5.base| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)) (= append_~plist.offset |append_#in~plist.offset|) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))))), 8095#(and (or (not (= append_~item~0.base append_~plist.base)) (and (= append_~item~0.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0)))) (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)))) (= append_~plist.offset |append_#in~plist.offset|) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)))))] [2018-02-02 10:10:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:12,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:10:12,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:10:12,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:10:12,915 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 24 states. [2018-02-02 10:10:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:13,909 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2018-02-02 10:10:13,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:10:13,909 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2018-02-02 10:10:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:13,909 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:10:13,910 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:10:13,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=308, Invalid=2142, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:10:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:10:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 112. [2018-02-02 10:10:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:10:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2018-02-02 10:10:13,912 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 66 [2018-02-02 10:10:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:13,912 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2018-02-02 10:10:13,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:10:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2018-02-02 10:10:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 10:10:13,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:13,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:13,912 INFO L371 AbstractCegarLoop]: === Iteration 34 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:13,913 INFO L82 PathProgramCache]: Analyzing trace with hash 341344119, now seen corresponding path program 1 times [2018-02-02 10:10:13,913 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:13,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 10:10:13,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:13,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:10:13,960 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:13,960 INFO L182 omatonBuilderFactory]: Interpolants [8400#false, 8401#(= main_~length~0 0), 8402#(<= 1 main_~length~0), 8403#(<= 2 main_~length~0), 8399#true] [2018-02-02 10:10:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 10:10:13,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:10:13,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:10:13,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:13,961 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 5 states. [2018-02-02 10:10:13,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:13,977 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-02-02 10:10:13,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:10:13,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-02-02 10:10:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:13,979 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:10:13,979 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:10:13,979 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:13,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:10:13,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-02 10:10:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-02 10:10:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2018-02-02 10:10:13,981 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 68 [2018-02-02 10:10:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:13,981 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2018-02-02 10:10:13,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:10:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2018-02-02 10:10:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:10:13,982 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:13,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:13,982 INFO L371 AbstractCegarLoop]: === Iteration 35 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:13,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2029014614, now seen corresponding path program 1 times [2018-02-02 10:10:13,983 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:13,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:14,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:14,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:10:14,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:14,442 INFO L182 omatonBuilderFactory]: Interpolants [8640#(and (= (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|)) (= append_~plist.base |append_#in~plist.base|) (or (not (= append_~item~0.base append_~plist.base)) (not (= append_~item~0.base 0))) (= append_~plist.offset |append_#in~plist.offset|)), 8641#(and (or (not (= append_~item~0.base append_~plist.base)) (and (= append_~item~0.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0)))) (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (= (select (select (store |#memory_$Pointer$.offset| append_~plist.base (store (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset append_~item~0.offset)) append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|)) (= append_~plist.offset |append_#in~plist.offset|)))), 8642#(or (and (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)) (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|))), 8643#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8644#(or (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8645#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 |main_#t~mem14.offset|)), 8646#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset)), 8647#(or (= 0 main_~next~0.offset) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8648#(or (= 0 main_~next~0.offset) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8649#(= 0 |main_#t~mem22.offset|), 8628#true, 8629#false, 8630#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 8631#(and (= append_~plist.base |append_#in~plist.base|) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 8632#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 8633#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)), 8634#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 8635#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 8636#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8637#(and (= append_~plist.base |append_#in~plist.base|) (not (= |append_#t~malloc1.base| 0)) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8638#(and (= append_~plist.base |append_#in~plist.base|) (or (not (= append_~item~0.base append_~plist.base)) (not (= append_~item~0.base 0))) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8639#(and (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset)) (or (not (= append_~item~0.base append_~plist.base)) (not (= append_~item~0.base 0))) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 10:10:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:14,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:10:14,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:10:14,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:10:14,442 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 22 states. [2018-02-02 10:10:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:15,087 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2018-02-02 10:10:15,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:10:15,087 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-02-02 10:10:15,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:15,088 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:10:15,088 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:10:15,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=283, Invalid=1787, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:10:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:10:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2018-02-02 10:10:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:10:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-02-02 10:10:15,090 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 69 [2018-02-02 10:10:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:15,090 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-02-02 10:10:15,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:10:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-02-02 10:10:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:10:15,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:15,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:15,091 INFO L371 AbstractCegarLoop]: === Iteration 36 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:15,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2029014615, now seen corresponding path program 1 times [2018-02-02 10:10:15,092 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:15,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:10:15,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:15,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:10:15,115 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:15,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:10:15,115 INFO L182 omatonBuilderFactory]: Interpolants [8934#true, 8935#false, 8936#(= |main_#t~mem20.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 8937#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 8938#(= 1 (select |#valid| |main_#t~mem22.base|))] [2018-02-02 10:10:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:10:15,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:10:15,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:10:15,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:15,115 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 5 states. [2018-02-02 10:10:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:15,160 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-02-02 10:10:15,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:10:15,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-02-02 10:10:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:15,161 INFO L225 Difference]: With dead ends: 114 [2018-02-02 10:10:15,161 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 10:10:15,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:10:15,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 10:10:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 10:10:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:10:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2018-02-02 10:10:15,163 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 69 [2018-02-02 10:10:15,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:15,163 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2018-02-02 10:10:15,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:10:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2018-02-02 10:10:15,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:10:15,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:15,164 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:15,164 INFO L371 AbstractCegarLoop]: === Iteration 37 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:15,164 INFO L82 PathProgramCache]: Analyzing trace with hash -32106665, now seen corresponding path program 1 times [2018-02-02 10:10:15,164 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:15,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:15,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:15,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:10:15,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:15,757 INFO 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:10:15,757 INFO L182 omatonBuilderFactory]: Interpolants [9171#true, 9172#false, 9173#(= 1 (select |#valid| |main_~#list~0.base|)), 9174#(= |#valid| |old(#valid)|), 9175#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 9176#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (not (= |append_#t~malloc1.base| 0)) (= append_~plist.offset |append_#in~plist.offset|)), 9177#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (not (= append_~item~0.base 0))), 9178#(and (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)))), 9179#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9180#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 9181#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|)), 9182#(and (= append_~plist.base |append_#in~plist.base|) (not (= |append_#t~malloc1.base| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|)), 9183#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (not (= append_~item~0.base append_~plist.base)) (not (= append_~item~0.base 0))) (= append_~plist.offset |append_#in~plist.offset|)), 9184#(and (= append_~plist.base |append_#in~plist.base|) (= (select (select |#memory_$Pointer$.base| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (not (= append_~item~0.base append_~plist.base)) (not (= append_~item~0.base 0))) (= append_~plist.offset |append_#in~plist.offset|)), 9185#(and (= append_~plist.base |append_#in~plist.base|) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (or (not (= append_~item~0.base append_~plist.base)) (not (= append_~item~0.base 0))) (= append_~plist.offset |append_#in~plist.offset|)), 9186#(and (or (not (= append_~item~0.base append_~plist.base)) (and (= append_~item~0.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0)))) (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) append_~item~0.offset))))), 9187#(or (and (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.base|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)))), 9188#(or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9189#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset|) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset|))))), 9190#(or (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= |main_~#list~0.base| |main_#t~mem14.base|)) (not (= |main_#t~mem14.base| 0)))), 9191#(or (and (not (= |main_~#list~0.base| main_~next~0.base)) (not (= main_~next~0.base 0))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9192#(or (and (not (= |main_~#list~0.base| main_~next~0.base)) (not (= main_~next~0.base 0))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9193#(or (and (not (= |main_~#list~0.base| main_~next~0.base)) (not (= main_~next~0.base 0))) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9194#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| |main_~#list~0.base|))), 9195#(and (not (= |main_#t~mem22.base| 0)) (not (= |main_~#list~0.base| |main_#t~mem22.base|)) (= 1 (select |#valid| |main_~#list~0.base|)))] [2018-02-02 10:10:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:15,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:10:15,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:10:15,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:10:15,758 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand 25 states. [2018-02-02 10:10:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:16,486 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-02-02 10:10:16,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:10:16,487 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 71 [2018-02-02 10:10:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:16,487 INFO L225 Difference]: With dead ends: 138 [2018-02-02 10:10:16,487 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 10:10:16,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=1698, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:10:16,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 10:10:16,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2018-02-02 10:10:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:10:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-02-02 10:10:16,490 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 71 [2018-02-02 10:10:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:16,490 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-02-02 10:10:16,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:10:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-02-02 10:10:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:10:16,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:16,491 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:16,491 INFO L371 AbstractCegarLoop]: === Iteration 38 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash 918170282, now seen corresponding path program 1 times [2018-02-02 10:10:16,491 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:16,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 10:10:16,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:16,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:10:16,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:16,517 INFO 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:10:16,518 INFO L182 omatonBuilderFactory]: Interpolants [9492#true, 9493#false, 9494#(= main_~length~0 0), 9495#(<= main_~length~0 1), 9496#(<= main_~length~0 2), 9497#(<= main_~length~0 0)] [2018-02-02 10:10:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 10:10:16,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:10:16,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:10:16,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:10:16,518 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 6 states. [2018-02-02 10:10:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:16,536 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-02-02 10:10:16,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:10:16,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2018-02-02 10:10:16,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:16,537 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:10:16,537 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:10:16,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:10:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:10:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-02-02 10:10:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:10:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-02-02 10:10:16,538 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 76 [2018-02-02 10:10:16,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:16,539 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-02-02 10:10:16,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:10:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-02-02 10:10:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 10:10:16,539 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:16,539 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:16,539 INFO L371 AbstractCegarLoop]: === Iteration 39 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:16,539 INFO L82 PathProgramCache]: Analyzing trace with hash 251881410, now seen corresponding path program 2 times [2018-02-02 10:10:16,540 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:16,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:10:17,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:17,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:10:17,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:10:17,795 INFO L182 omatonBuilderFactory]: Interpolants [9745#true, 9746#false, 9747#(= (select |#valid| |main_~#list~0.base|) 1), 9748#(= |#valid| |old(#valid)|), 9749#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 9750#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 9751#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 9752#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= 0 |append_#t~malloc7.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 9753#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= 0 |append_#t~ite8.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 9754#(and (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= 0 (select (select (store |#memory_$Pointer$.offset| append_~plist.base (store (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset append_~item~0.offset)) append_~item~0.base) (+ append_~item~0.offset 4))) (= append_~plist.offset |append_#in~plist.offset|)))), 9755#(or (and (= (select |#valid| |append_#in~plist.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= 0 (select |old(#valid)| |append_#in~plist.base|))), 9756#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= (select |#valid| |main_~#list~0.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 9757#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9758#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9759#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9760#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9761#(and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= (select |#valid| |append_#in~plist.base|) 1) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9762#(and (= append_~plist.base |append_#in~plist.base|) (= (select |#valid| |append_#in~plist.base|) 1) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= (store |old(#memory_$Pointer$.offset)| append_~item~0.base (select |#memory_$Pointer$.offset| append_~item~0.base)) |#memory_$Pointer$.offset|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))), 9763#(and (= append_~plist.base |append_#in~plist.base|) (or (and (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1)) (not (= |append_#t~mem5.offset| 0))) (or (= append_~item~0.base |append_#t~mem5.base|) (= (select |#memory_$Pointer$.offset| |append_#t~mem5.base|) (select |old(#memory_$Pointer$.offset)| |append_#t~mem5.base|))) (= (select |#valid| |append_#in~plist.base|) 1) (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#t~mem5.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= 0 (select |old(#valid)| append_~item~0.base))), 9764#(and (= append_~plist.base |append_#in~plist.base|) (= (select |#valid| |append_#in~plist.base|) 1) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (and (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~mem6.offset|)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 9765#(and (= append_~plist.base |append_#in~plist.base|) (= (select |#valid| |append_#in~plist.base|) 1) (or (and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~ite8.offset|) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1)) (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 9766#(and (= append_~plist.base |append_#in~plist.base|) (= (select |#valid| |append_#in~plist.base|) 1) (= append_~plist.offset |append_#in~plist.offset|) (or (and (or (= append_~plist.base append_~item~0.base) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) (select (select (store |#memory_$Pointer$.offset| append_~plist.base (store (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset append_~item~0.offset)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1)) (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0))) (= 0 (select |old(#valid)| append_~item~0.base))), 9767#(and (= (select |#valid| |append_#in~plist.base|) 1) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)) (or (and (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1)) (= 0 (select |old(#valid)| |append_#in~plist.base|)))))), 9768#(and (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (not (= append_~item~0.base append_~plist.base))) (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))), 9769#(and (or (= append_~item~0.base append_~plist.base) (and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (not (= append_~item~0.base append_~plist.base)))), 9770#(and (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= (store |old(#memory_$Pointer$.offset)| append_~item~0.base (select |#memory_$Pointer$.offset| append_~item~0.base)) |#memory_$Pointer$.offset|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)))) (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (not (= append_~item~0.base append_~plist.base)))), 9771#(and (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (or (and (or (= append_~item~0.base |append_#t~mem5.base|) (= (select |#memory_$Pointer$.offset| |append_#t~mem5.base|) (select |old(#memory_$Pointer$.offset)| |append_#t~mem5.base|))) (= |append_#t~mem5.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= 0 (select |old(#valid)| append_~item~0.base))) (not (= |append_#t~mem5.offset| 0))) (= append_~item~0.offset 0) (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)) (= append_~plist.offset |append_#in~plist.offset|))) (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (not (= append_~item~0.base append_~plist.base)))), 9772#(and (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~mem6.offset|)) (= 0 (select |old(#valid)| append_~item~0.base)))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|))) (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (not (= append_~item~0.base append_~plist.base)))), 9773#(and (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (not (= append_~item~0.base append_~plist.base))) (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~ite8.offset|)) (= 0 (select |old(#valid)| append_~item~0.base)))) (= append_~plist.offset |append_#in~plist.offset|)))), 9774#(and (or (and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) (select (select (store |#memory_$Pointer$.offset| append_~plist.base (store (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset append_~item~0.offset)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= 0 (select |old(#valid)| append_~item~0.base)))) (= append_~plist.offset |append_#in~plist.offset|)) (= append_~item~0.base append_~plist.base)) (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (not (= append_~item~0.base append_~plist.base)))), 9775#(or (and (or (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 0 (select |old(#valid)| |append_#in~plist.base|))), 9776#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))), 9777#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 9778#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4))) (= |main_#t~mem15.offset| 0)), 9779#(= |main_#t~mem16.offset| 0)] [2018-02-02 10:10:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:10:17,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 10:10:17,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 10:10:17,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1103, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:10:17,796 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 35 states. [2018-02-02 10:10:18,950 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 105 DAG size of output 81 [2018-02-02 10:10:19,110 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 114 DAG size of output 84 [2018-02-02 10:10:19,259 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 121 DAG size of output 88 [2018-02-02 10:10:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:19,766 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-02-02 10:10:19,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:10:19,766 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2018-02-02 10:10:19,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:19,767 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:10:19,767 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:10:19,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=337, Invalid=3203, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:10:19,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:10:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-02 10:10:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 10:10:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2018-02-02 10:10:19,769 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 77 [2018-02-02 10:10:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:19,769 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2018-02-02 10:10:19,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 10:10:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-02-02 10:10:19,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 10:10:19,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:19,769 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:19,769 INFO L371 AbstractCegarLoop]: === Iteration 40 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:19,770 INFO L82 PathProgramCache]: Analyzing trace with hash 251881411, now seen corresponding path program 2 times [2018-02-02 10:10:19,770 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:19,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:10:21,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:21,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 10:10:21,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:10:21,489 INFO L182 omatonBuilderFactory]: Interpolants [10072#true, 10073#false, 10074#(= (select |#valid| |main_~#list~0.base|) 1), 10075#(= |#valid| |old(#valid)|), 10076#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 10077#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 10078#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 10079#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= (select |#valid| |append_#t~malloc7.base|) 1) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 10080#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= 1 (select |#valid| |append_#t~ite8.base|)) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 10081#(and (or (and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4))) 1) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|)) (= append_~plist.base append_~item~0.base)) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|)))), 10082#(or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (and (= (select |#valid| |append_#in~plist.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)))), 10083#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) 1) (= (select |#valid| |main_~#list~0.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 10084#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10085#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10086#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#valid| (store |old(#valid)| |append_#t~malloc1.base| (select |#valid| |append_#t~malloc1.base|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10087#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10088#(and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= (select |#valid| |append_#in~plist.base|) 1) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10089#(and (= append_~plist.base |append_#in~plist.base|) (= (select |#valid| |append_#in~plist.base|) 1) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10090#(and (= append_~plist.base |append_#in~plist.base|) (= (select |#valid| |append_#in~plist.base|) 1) (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)) (or (= append_~item~0.base |append_#t~mem5.base|) (= (select |old(#memory_$Pointer$.base)| |append_#t~mem5.base|) (select |#memory_$Pointer$.base| |append_#t~mem5.base|))) (or (and (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= |append_#t~mem5.offset| 0))) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#t~mem5.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= 0 (select |old(#valid)| append_~item~0.base))), 10091#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (and (= (select |#valid| |append_#in~plist.base|) 1) (or (and (= |append_#t~mem6.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4)) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0))))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 10092#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (and (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~ite8.base|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= (select |#valid| |append_#in~plist.base|) 1))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 10093#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (and (= (select |#valid| |append_#in~plist.base|) 1) (or (= append_~plist.base append_~item~0.base) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 10094#(or (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (and (= (select |#valid| |append_#in~plist.base|) 1) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= 0 (select |old(#valid)| |append_#in~plist.base|))))), 10095#(and (= append_~plist.base |append_#in~plist.base|) (or (= |#valid| |old(#valid)|) (= append_~item~0.base (@diff |old(#valid)| |#valid|))) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10096#(and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (or (= |#valid| |old(#valid)|) (= append_~item~0.base (@diff |old(#valid)| |#valid|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10097#(and (= append_~plist.base |append_#in~plist.base|) (or (= |#valid| |old(#valid)|) (= (select |#valid| append_~item~0.base) 1)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10098#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= append_~item~0.offset 0) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10099#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)) (or (and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= |append_#t~mem5.offset| 0))) (or (= append_~item~0.base |append_#t~mem5.base|) (= (select |old(#memory_$Pointer$.base)| |append_#t~mem5.base|) (select |#memory_$Pointer$.base| |append_#t~mem5.base|))) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#t~mem5.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= 0 (select |old(#valid)| append_~item~0.base))), 10100#(and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (= |append_#t~mem6.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4)) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 10101#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (= |append_#t~ite8.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4)) (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 10102#(and (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)))) (or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (not (= append_~item~0.base append_~plist.base)))), 10103#(or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= 0 (select |old(#valid)| |append_#in~plist.base|))), 10104#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))), 10105#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 10106#(and (= 0 |main_#t~mem15.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4))))), 10107#(= 1 (select |#valid| |main_#t~mem16.base|))] [2018-02-02 10:10:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:10:21,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 10:10:21,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 10:10:21,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:10:21,490 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand 36 states. [2018-02-02 10:10:23,139 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 109 DAG size of output 76 [2018-02-02 10:10:23,290 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 118 DAG size of output 79 [2018-02-02 10:10:23,485 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 133 DAG size of output 90 [2018-02-02 10:10:23,658 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 100 DAG size of output 77 [2018-02-02 10:10:24,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:24,022 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2018-02-02 10:10:24,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:10:24,022 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 77 [2018-02-02 10:10:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:24,023 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:10:24,023 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:10:24,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=353, Invalid=3307, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 10:10:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:10:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-02 10:10:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 10:10:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2018-02-02 10:10:24,025 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 77 [2018-02-02 10:10:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:24,025 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2018-02-02 10:10:24,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 10:10:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2018-02-02 10:10:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 10:10:24,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:24,025 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:24,025 INFO L371 AbstractCegarLoop]: === Iteration 41 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1892144135, now seen corresponding path program 1 times [2018-02-02 10:10:24,026 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:24,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:10:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:27,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:27,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 10:10:27,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:27,818 INFO 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:10:27,819 INFO L182 omatonBuilderFactory]: Interpolants [10432#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (store (store |#valid| |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10433#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= |old(#valid)| (store (store |#valid| |main_~#list~0.base| 0) |main_#t~mem22.base| (select (store |#valid| |main_#t~mem22.base| 0) |main_#t~mem22.base|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 10434#(or (= |old(#valid)| (store |#valid| |main_~#list~0.base| (select (store |#valid| |main_~#list~0.base| 0) |main_~#list~0.base|))) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10398#true, 10399#false, 10400#(= |#valid| |old(#valid)|), 10401#(= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|), 10402#(and (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 10403#(and (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (not (= |append_#t~malloc1.base| 0)) (= |old(#valid)| (store |#valid| |append_#t~malloc1.base| (select |old(#valid)| |append_#t~malloc1.base|))) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 10404#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (= |#valid| |old(#valid)|) (= append_~item~0.base (@diff |#valid| |old(#valid)|))) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (not (= append_~item~0.base 0))), 10405#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (not (= append_~item~0.base 0))), 10406#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| |append_#t~malloc7.base|)) (not (= 0 |append_#t~malloc7.base|)) (= append_~item~0.offset 0) (= |old(#valid)| (store (store |#valid| |append_#t~malloc7.base| (select |old(#valid)| |append_#t~malloc7.base|)) append_~item~0.base (select |old(#valid)| append_~item~0.base))) (not (= append_~item~0.base |append_#t~malloc7.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= 0 (select |old(#valid)| |append_#t~malloc7.base|)) (not (= append_~item~0.base 0))), 10407#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (not (= 0 |append_#t~ite8.base|)) (not (= append_~item~0.base |append_#t~ite8.base|)) (= 1 (select |#valid| |append_#t~ite8.base|)) (= 0 (select |old(#valid)| |append_#t~ite8.base|)) (= (store (store |#valid| |append_#t~ite8.base| (select |old(#valid)| |append_#t~ite8.base|)) append_~item~0.base (select |old(#valid)| append_~item~0.base)) |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (not (= append_~item~0.base 0))), 10408#(and (or (not (= append_~plist.base append_~item~0.base)) (= append_~item~0.base |append_#in~plist.base|)) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0)) (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (not (= 0 (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= 0 (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= (store (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (select |old(#valid)| (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) |old(#valid)|) (not (= append_~item~0.base (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= 0 (select |old(#valid)| append_~item~0.base))))), 10409#(and (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1) (or (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.base|) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= |old(#valid)| (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)))))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 10410#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_~#list~0.base|) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (or (and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 10411#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10412#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10413#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (not (= |append_#t~malloc1.base| 0)) (= 0 |append_#t~malloc1.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#valid| (store |old(#valid)| |append_#t~malloc1.base| (select |#valid| |append_#t~malloc1.base|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10414#(and (or (= append_~item~0.base |append_#in~plist.base|) (not (= append_~item~0.base append_~plist.base))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (store |old(#valid)| append_~item~0.base (select |#valid| append_~item~0.base)) |#valid|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (not (= append_~item~0.base 0))), 10415#(and (or (= append_~item~0.base |append_#in~plist.base|) (not (= append_~item~0.base append_~plist.base))) (= append_~item~0.offset 0) (or (= append_~item~0.base append_~plist.base) (and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (store |old(#valid)| append_~item~0.base (select |#valid| append_~item~0.base)) |#valid|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0))), 10416#(and (or (= append_~item~0.base |append_#in~plist.base|) (not (= append_~item~0.base append_~plist.base))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0)) (or (and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= (store |old(#valid)| append_~item~0.base (select |#valid| append_~item~0.base)) |#valid|) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))) (= append_~item~0.base append_~plist.base))), 10417#(and (or (= append_~item~0.base append_~plist.base) (and (or (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset))) (not (= |append_#t~mem5.base| append_~item~0.base))) (= append_~plist.base |append_#in~plist.base|) (or (= |append_#t~mem5.base| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= |append_#t~mem5.base| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (or (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= (store |old(#valid)| append_~item~0.base (select |#valid| append_~item~0.base)) |#valid|) (= 0 (select |old(#valid)| append_~item~0.base))) (not (= |append_#t~mem5.offset| 0))) (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)))) (or (= append_~item~0.base |append_#in~plist.base|) (not (= append_~item~0.base append_~plist.base))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0))), 10418#(and (or (= append_~item~0.base |append_#in~plist.base|) (not (= append_~item~0.base append_~plist.base))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (or (and (not (= append_~item~0.base (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset))) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= |append_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) 4)) (= (store |old(#valid)| append_~item~0.base (select |#valid| append_~item~0.base)) |#valid|) (= 0 (select |old(#valid)| append_~item~0.base))))) (and (= append_~plist.base (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (and (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset))))))) (not (= append_~item~0.base 0))), 10419#(and (or (= append_~item~0.base append_~plist.base) (and (= append_~plist.base |append_#in~plist.base|) (or (and (= append_~plist.base (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (and (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= (select (select (store |#memory_$Pointer$.base| append_~item~0.base (store (select |#memory_$Pointer$.base| append_~item~0.base) (+ append_~item~0.offset 4) |append_#t~ite8.base|)) (select (store (select |#memory_$Pointer$.base| append_~item~0.base) (+ append_~item~0.offset 4) |append_#t~ite8.base|) append_~item~0.offset)) 4) |append_#t~ite8.base|) (= (store |old(#valid)| append_~item~0.base (select |#valid| append_~item~0.base)) |#valid|) (= 0 (select |old(#valid)| append_~item~0.base))))) (and (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset))))))) (or (= append_~item~0.base |append_#in~plist.base|) (not (= append_~item~0.base append_~plist.base))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0))), 10420#(and (or (= append_~item~0.base append_~plist.base) (and (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (= append_~plist.base (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (and (= (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)) (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) append_~item~0.offset)) 4)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= (store |old(#valid)| append_~item~0.base (select |#valid| append_~item~0.base)) |#valid|) (= 0 (select |old(#valid)| append_~item~0.base)))) (= append_~plist.base |append_#in~plist.base|) (= (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)))) (or (= append_~item~0.base |append_#in~plist.base|) (not (= append_~item~0.base append_~plist.base))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (not (= append_~item~0.base 0))), 10421#(and (not (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (or (and (or (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.base|) (and (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= 0 (select |old(#valid)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |append_#in~plist.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|)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))) 4)) (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~plist.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 |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (= (store |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) |old(#valid)|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)) (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.base|))), 10422#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |old(#valid)| (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= 0 (select (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base|)))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10423#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset|) 0)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (or (and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset|) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |old(#valid)| (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 4) 0) (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset|) 0)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 4) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base|)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10424#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (or (= |main_~#list~0.base| |main_#t~mem14.base|) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= 0 (select (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base|)) (and (not (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= |main_#t~mem14.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= |old(#valid)| (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) 0) |main_#t~mem14.base| 0)))) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))))) (not (= |main_#t~mem14.base| 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10425#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (or (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= |old(#valid)| (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) 0) main_~next~0.base 0))) (= 0 (select (store (store |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))) (= |main_~#list~0.base| main_~next~0.base)) (not (= main_~next~0.base 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10426#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (not (= main_~next~0.base 0)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))) (or (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))) (= (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)) 0) main_~next~0.base 0) |old(#valid)|) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4))))) (and (= 0 (select (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))))) (= |main_#t~mem15.offset| 0)) (= |main_~#list~0.base| main_~next~0.base))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10427#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (or (and (or (not (= 1 (select |#valid| |main_#t~mem16.base|))) (and (or (not (= (select (store (store |#valid| |main_#t~mem16.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base|) (select |#valid| |main_#t~mem16.base|))) (and (not (= main_~next~0.base |main_#t~mem16.base|)) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |old(#valid)| (store (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) |main_#t~mem16.base| (select (store |#valid| |main_#t~mem16.base| 0) |main_#t~mem16.base|)) main_~next~0.base 0)))) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem16.base|)))) (not (= 0 |main_#t~mem16.base|))) (= |main_~#list~0.base| main_~next~0.base)) (not (= main_~next~0.base 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10428#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (and (not (= main_~next~0.base 0)) (or (not (= (select (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base|) 1)) (and (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |main_~#list~0.base| 0) main_~next~0.base 0) |old(#valid)|)) (= |main_~#list~0.base| main_~next~0.base))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10429#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_#t~mem17.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (or (not (= (select (store |#valid| |main_#t~mem17.base| 0) |main_~#list~0.base|) 1)) (= |main_~#list~0.base| main_~next~0.base) (and (= (store (store (store |#valid| |main_#t~mem17.base| (select (store |#valid| |main_#t~mem17.base| 0) |main_#t~mem17.base|)) |main_~#list~0.base| 0) main_~next~0.base 0) |old(#valid)|) (not (= main_~next~0.base |main_#t~mem17.base|)))) (not (= main_~next~0.base 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10430#(or (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= main_~next~0.base 0)) (or (= |main_~#list~0.base| main_~next~0.base) (not (= (select |#valid| |main_~#list~0.base|) 1)) (= |old(#valid)| (store (store |#valid| |main_~#list~0.base| 0) main_~next~0.base 0))))), 10431#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (or (= (store (store |#valid| |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 1 (select |#valid| |main_~#list~0.base|)))] [2018-02-02 10:10:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:27,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 10:10:27,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 10:10:27,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1249, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:10:27,819 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand 37 states. [2018-02-02 10:10:29,319 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 110 DAG size of output 83 [2018-02-02 10:10:29,595 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 127 DAG size of output 99 [2018-02-02 10:10:29,935 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 89 DAG size of output 80 [2018-02-02 10:10:30,460 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 89 DAG size of output 88 [2018-02-02 10:10:30,718 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 117 DAG size of output 115 [2018-02-02 10:10:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:31,535 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-02-02 10:10:31,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:10:31,535 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2018-02-02 10:10:31,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:31,536 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:10:31,536 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 10:10:31,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=261, Invalid=3771, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 10:10:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 10:10:31,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-02-02 10:10:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 10:10:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-02-02 10:10:31,539 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 78 [2018-02-02 10:10:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:31,539 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-02-02 10:10:31,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 10:10:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-02-02 10:10:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 10:10:31,540 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:31,540 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, 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:10:31,540 INFO L371 AbstractCegarLoop]: === Iteration 42 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:31,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1539866915, now seen corresponding path program 2 times [2018-02-02 10:10:31,541 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:31,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:10:33,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:10:33,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 10:10:33,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:10:33,018 INFO L182 omatonBuilderFactory]: Interpolants [10710#true, 10711#false, 10712#(not (= 0 |main_~#list~0.base|)), 10713#(and (not (= 0 |main_~#list~0.base|)) (= 1 (select |#valid| |main_~#list~0.base|))), 10714#(= |#valid| |old(#valid)|), 10715#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 10716#(and (= (select |old(#valid)| |append_#t~malloc1.base|) 0) (= append_~plist.base |append_#in~plist.base|) (= 0 |append_#t~malloc1.offset|) (= append_~plist.offset |append_#in~plist.offset|)), 10717#(and (= append_~plist.base |append_#in~plist.base|) (or (and (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)) (= append_~plist.base append_~item~0.base)) (or (not (= append_~plist.base append_~item~0.base)) (= (select |old(#valid)| |append_#in~plist.base|) 0))), 10718#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.base append_~item~0.base) (and (= append_~item~0.offset 0) (= (select |#valid| append_~plist.base) 1) (= append_~plist.offset |append_#in~plist.offset|))) (or (not (= append_~plist.base append_~item~0.base)) (= (select |old(#valid)| |append_#in~plist.base|) 0))), 10719#(and (= append_~plist.base |append_#in~plist.base|) (or (and (not (= append_~plist.base |append_#t~malloc7.base|)) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)) (= append_~plist.base append_~item~0.base)) (or (not (= append_~plist.base append_~item~0.base)) (= (select |old(#valid)| |append_#in~plist.base|) 0))), 10720#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.base append_~item~0.base) (and (not (= |append_#in~plist.base| |append_#t~ite8.base|)) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|))) (or (not (= append_~plist.base append_~item~0.base)) (= (select |old(#valid)| |append_#in~plist.base|) 0))), 10721#(and (= append_~plist.base |append_#in~plist.base|) (= (select |#valid| append_~item~0.base) 1) (or (= append_~plist.base append_~item~0.base) (and (not (= |append_#in~plist.base| (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|))) (or (not (= append_~plist.base append_~item~0.base)) (= (select |old(#valid)| |append_#in~plist.base|) 0))), 10722#(or (= (select |old(#valid)| |append_#in~plist.base|) 0) (and (= (select |#valid| |append_#in~plist.base|) 1) (not (= |append_#in~plist.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)))), 10723#(and (not (= 0 |main_~#list~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| |main_~#list~0.base|) 1) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 10724#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10725#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10726#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc1.base|)) (= 0 |append_#t~malloc1.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10727#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10728#(and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= 1 (select |#valid| append_~plist.base)) (= append_~item~0.offset 0) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10729#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~plist.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset))), 10730#(and (= append_~plist.base |append_#in~plist.base|) (or (and (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1)) (not (= |append_#t~mem5.offset| 0))) (= 1 (select |#valid| append_~plist.base)) (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)) (or (= append_~item~0.base |append_#t~mem5.base|) (= (select |old(#memory_$Pointer$.base)| |append_#t~mem5.base|) (select |#memory_$Pointer$.base| |append_#t~mem5.base|))) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#t~mem5.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= 0 (select |old(#valid)| append_~item~0.base))), 10731#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~plist.base)) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~mem6.base|) (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 10732#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~plist.base)) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~ite8.base|))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 10733#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~plist.base)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (or (= append_~plist.base append_~item~0.base) (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (= append_~item~0.offset 0) (= (select |#valid| append_~item~0.base) 1) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))))), 10734#(and (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= 1 (select |#valid| |append_#in~plist.base|))), 10735#(and (= 0 append_~item~0.offset) (or (= append_~item~0.base append_~plist.base) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (= (select |old(#valid)| |append_#in~plist.base|) 0) (not (= append_~item~0.base append_~plist.base))) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 10736#(and (= 0 append_~item~0.offset) (or (and (= (select |old(#valid)| |append_#in~plist.base|) 0) (= 1 (select |#valid| append_~plist.base))) (not (= append_~item~0.base append_~plist.base))) (or (= append_~item~0.base append_~plist.base) (and (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem3.offset|) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= 1 (select |#valid| append_~plist.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 (select |old(#valid)| append_~item~0.base)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 10737#(and (= 0 append_~item~0.offset) (or (= append_~item~0.base append_~plist.base) (and (= 1 (select |#valid| append_~plist.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| append_~item~0.base (select |#memory_$Pointer$.base| append_~item~0.base))) (= 0 (select |old(#valid)| append_~item~0.base)) (= (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset) (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)))) (or (and (= (select |old(#valid)| |append_#in~plist.base|) 0) (= 1 (select |#valid| append_~plist.base))) (not (= append_~item~0.base append_~plist.base))) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 10738#(and (= 0 append_~item~0.offset) (= 1 (select |#valid| append_~plist.base)) (or (= append_~item~0.base append_~plist.base) (and (or (= |append_#t~mem5.offset| 0) (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem5.offset|)) (or (= append_~item~0.base |append_#t~mem5.base|) (= (select |old(#memory_$Pointer$.base)| |append_#t~mem5.base|) (select |#memory_$Pointer$.base| |append_#t~mem5.base|))) (= |append_#t~mem5.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= 0 (select |old(#valid)| append_~item~0.base)))) (or (= (select |old(#valid)| |append_#in~plist.base|) 0) (not (= append_~item~0.base append_~plist.base))) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 10739#(and (= 0 append_~item~0.offset) (or (= append_~item~0.base append_~plist.base) (and (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~mem6.base|) (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0))) (= 0 (select |old(#valid)| append_~item~0.base)))) (= 1 (select |#valid| append_~plist.base)) (or (= (select |old(#valid)| |append_#in~plist.base|) 0) (not (= append_~item~0.base append_~plist.base))) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 10740#(and (= 0 append_~item~0.offset) (= 1 (select |#valid| append_~plist.base)) (or (= append_~item~0.base append_~plist.base) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~ite8.base|)) (= 0 (select |old(#valid)| append_~item~0.base)))) (or (= (select |old(#valid)| |append_#in~plist.base|) 0) (not (= append_~item~0.base append_~plist.base))) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 10741#(and (= 0 append_~item~0.offset) (or (= append_~item~0.base append_~plist.base) (and (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) (select (select (store |#memory_$Pointer$.base| append_~plist.base (store (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset append_~item~0.base)) append_~item~0.base) (+ append_~item~0.offset 4)))) (= 1 (select |#valid| append_~plist.base)) (= 0 (select |old(#valid)| append_~item~0.base)))) (or (and (= (select |old(#valid)| |append_#in~plist.base|) 0) (= 1 (select |#valid| append_~plist.base))) (not (= append_~item~0.base append_~plist.base))) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 10742#(and (= 1 (select |#valid| |append_#in~plist.base|)) (or (= (select |old(#valid)| |append_#in~plist.base|) 0) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4)) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))), 10743#(and (not (= 0 |main_~#list~0.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= 1 (select |#valid| |main_~#list~0.base|))), 10744#(and (not (= 0 |main_~#list~0.base|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| |main_~#list~0.base|))), 10745#(and (not (= 0 |main_~#list~0.base|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem15.base|) (+ |main_#t~mem15.offset| 4)))) (= 1 (select |#valid| |main_~#list~0.base|)) (= |main_#t~mem15.offset| 0)), 10746#(= 1 (select (store |#valid| |main_#t~mem16.base| 0) |main_~#list~0.base|)), 10747#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-02 10:10:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 29 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:10:33,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 10:10:33,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 10:10:33,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:10:33,019 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 38 states. [2018-02-02 10:10:34,453 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 120 DAG size of output 84 [2018-02-02 10:10:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:34,832 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-02 10:10:34,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:10:34,833 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2018-02-02 10:10:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:34,833 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:10:34,833 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:10:34,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=391, Invalid=3391, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:10:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:10:34,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-02 10:10:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 10:10:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2018-02-02 10:10:34,835 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 79 [2018-02-02 10:10:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:34,835 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2018-02-02 10:10:34,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 10:10:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2018-02-02 10:10:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 10:10:34,836 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:34,836 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, 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:10:34,836 INFO L371 AbstractCegarLoop]: === Iteration 43 === [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, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 10:10:34,836 INFO L82 PathProgramCache]: Analyzing trace with hash 491234129, now seen corresponding path program 2 times [2018-02-02 10:10:34,836 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:34,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:35,102 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-02-02 10:10:35,102 ERROR L119 erpolLogProxyWrapper]: Interpolant 76 not inductive: (Check returned sat) [2018-02-02 10:10:35,103 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Asserted terms must be closed at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:956) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:10:35,106 INFO L168 Benchmark]: Toolchain (without parser) took 49859.29 ms. Allocated memory was 404.8 MB in the beginning and 1.3 GB in the end (delta: 881.9 MB). Free memory was 361.4 MB in the beginning and 1.1 GB in the end (delta: -780.3 MB). Peak memory consumption was 800.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:35,107 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:10:35,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.59 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 350.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:35,108 INFO L168 Benchmark]: Boogie Preprocessor took 26.61 ms. Allocated memory is still 404.8 MB. Free memory was 350.9 MB in the beginning and 349.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:35,108 INFO L168 Benchmark]: RCFGBuilder took 332.36 ms. Allocated memory is still 404.8 MB. Free memory was 349.5 MB in the beginning and 319.1 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:35,108 INFO L168 Benchmark]: TraceAbstraction took 49349.97 ms. Allocated memory was 404.8 MB in the beginning and 1.3 GB in the end (delta: 881.9 MB). Free memory was 319.1 MB in the beginning and 1.1 GB in the end (delta: -822.6 MB). Peak memory consumption was 758.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:35,110 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 147.59 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 350.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.61 ms. Allocated memory is still 404.8 MB. Free memory was 350.9 MB in the beginning and 349.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 332.36 ms. Allocated memory is still 404.8 MB. Free memory was 349.5 MB in the beginning and 319.1 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 49349.97 ms. Allocated memory was 404.8 MB in the beginning and 1.3 GB in the end (delta: 881.9 MB). Free memory was 319.1 MB in the beginning and 1.1 GB in the end (delta: -822.6 MB). Peak memory consumption was 758.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Asserted terms must be closed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-10-35-123.csv Received shutdown request...