java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:01:13,259 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:01:13,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:01:13,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:01:13,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:01:13,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:01:13,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:01:13,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:01:13,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:01:13,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:01:13,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:01:13,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:01:13,277 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:01:13,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:01:13,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:01:13,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:01:13,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:01:13,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:01:13,284 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:01:13,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:01:13,287 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:01:13,287 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:01:13,287 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:01:13,288 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:01:13,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:01:13,289 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:01:13,290 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:01:13,290 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:01:13,290 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:01:13,290 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:01:13,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:01:13,291 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 02:01:13,300 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:01:13,300 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:01:13,301 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:01:13,301 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:01:13,302 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:01:13,302 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:01:13,302 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:01:13,302 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:01:13,302 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:01:13,302 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:01:13,302 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:01:13,303 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:01:13,303 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:01:13,303 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:01:13,303 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:01:13,303 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:01:13,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:01:13,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:01:13,304 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:01:13,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:01:13,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:01:13,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:01:13,304 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:01:13,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:01:13,340 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:01:13,344 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:01:13,345 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:01:13,345 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:01:13,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i [2018-02-04 02:01:13,479 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:01:13,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:01:13,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:01:13,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:01:13,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:01:13,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:01:13" (1/1) ... [2018-02-04 02:01:13,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fbafac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:13, skipping insertion in model container [2018-02-04 02:01:13,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:01:13" (1/1) ... [2018-02-04 02:01:13,504 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:01:13,532 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:01:13,618 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:01:13,629 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:01:13,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:13 WrapperNode [2018-02-04 02:01:13,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:01:13,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:01:13,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:01:13,635 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:01:13,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:13" (1/1) ... [2018-02-04 02:01:13,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:13" (1/1) ... [2018-02-04 02:01:13,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:13" (1/1) ... [2018-02-04 02:01:13,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:13" (1/1) ... [2018-02-04 02:01:13,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:13" (1/1) ... [2018-02-04 02:01:13,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:13" (1/1) ... [2018-02-04 02:01:13,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:13" (1/1) ... [2018-02-04 02:01:13,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:01:13,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:01:13,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:01:13,662 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:01:13,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:13" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:01:13,698 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:01:13,698 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:01:13,698 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 02:01:13,698 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:01:13,698 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 02:01:13,698 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 02:01:13,698 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:01:13,699 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:01:13,699 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:01:13,699 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:01:13,699 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:01:13,699 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 02:01:13,699 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 02:01:13,699 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:01:13,699 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:01:13,699 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:01:14,000 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:01:14,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:01:14 BoogieIcfgContainer [2018-02-04 02:01:14,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:01:14,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:01:14,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:01:14,003 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:01:14,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:01:13" (1/3) ... [2018-02-04 02:01:14,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34bd7266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:01:14, skipping insertion in model container [2018-02-04 02:01:14,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:01:13" (2/3) ... [2018-02-04 02:01:14,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34bd7266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:01:14, skipping insertion in model container [2018-02-04 02:01:14,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:01:14" (3/3) ... [2018-02-04 02:01:14,006 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-free.i [2018-02-04 02:01:14,011 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:01:14,016 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2018-02-04 02:01:14,038 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:01:14,038 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:01:14,038 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:01:14,038 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:01:14,039 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:01:14,039 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:01:14,039 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:01:14,039 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:01:14,040 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:01:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2018-02-04 02:01:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 02:01:14,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:14,058 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:01:14,059 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash 842410072, now seen corresponding path program 1 times [2018-02-04 02:01:14,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:14,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:14,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-04 02:01:14,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:14,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:01:14,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:14,157 INFO L182 omatonBuilderFactory]: Interpolants [120#true, 121#false, 122#(= 1 (select |#valid| |main_~#list~0.base|))] [2018-02-04 02:01:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:14,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:01:14,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:01:14,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:01:14,167 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2018-02-04 02:01:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:14,335 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-02-04 02:01:14,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:01:14,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 02:01:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:14,345 INFO L225 Difference]: With dead ends: 115 [2018-02-04 02:01:14,345 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 02:01:14,346 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:01:14,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 02:01:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-02-04 02:01:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 02:01:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-02-04 02:01:14,378 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 7 [2018-02-04 02:01:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:14,378 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-02-04 02:01:14,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:01:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-02-04 02:01:14,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 02:01:14,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:14,379 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:01:14,379 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:14,380 INFO L82 PathProgramCache]: Analyzing trace with hash 842410073, now seen corresponding path program 1 times [2018-02-04 02:01:14,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:14,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:14,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:14,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:01:14,425 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:14,426 INFO L182 omatonBuilderFactory]: Interpolants [347#true, 348#false, 349#(and (= (select |#length| |main_~#list~0.base|) 4) (= |main_~#list~0.offset| 0))] [2018-02-04 02:01:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:14,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:01:14,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:01:14,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:01:14,428 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 3 states. [2018-02-04 02:01:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:14,500 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-02-04 02:01:14,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:01:14,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 02:01:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:14,502 INFO L225 Difference]: With dead ends: 110 [2018-02-04 02:01:14,502 INFO L226 Difference]: Without dead ends: 110 [2018-02-04 02:01:14,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:01:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-04 02:01:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-02-04 02:01:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 02:01:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-02-04 02:01:14,510 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 7 [2018-02-04 02:01:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:14,510 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-02-04 02:01:14,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:01:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-02-04 02:01:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 02:01:14,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:14,511 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:01:14,511 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:14,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1112643303, now seen corresponding path program 1 times [2018-02-04 02:01:14,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:14,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:14,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:14,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:01:14,575 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:14,575 INFO L182 omatonBuilderFactory]: Interpolants [568#true, 569#false, 570#(= 1 (select |#valid| |main_~#list~0.base|)), 571#(= 1 (select |#valid| |append_#in~plist.base|)), 572#(= 1 (select |#valid| append_~plist.base))] [2018-02-04 02:01:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:14,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:01:14,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:01:14,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:01:14,576 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 5 states. [2018-02-04 02:01:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:14,696 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-02-04 02:01:14,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:01:14,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 02:01:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:14,697 INFO L225 Difference]: With dead ends: 106 [2018-02-04 02:01:14,698 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 02:01:14,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:01:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 02:01:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-02-04 02:01:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 02:01:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-02-04 02:01:14,704 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 13 [2018-02-04 02:01:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:14,704 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-02-04 02:01:14,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:01:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-02-04 02:01:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 02:01:14,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:14,705 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:01:14,705 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1112643304, now seen corresponding path program 1 times [2018-02-04 02:01:14,706 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:14,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:14,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:14,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:01:14,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:14,809 INFO L182 omatonBuilderFactory]: Interpolants [786#true, 787#false, 788#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4)), 789#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4) (= (select |#valid| |main_~#list~0.base|) 1)), 790#(and (= (select |#valid| |append_#in~plist.base|) 1) (<= 4 (select |#length| |append_#in~plist.base|)) (= 0 |append_#in~plist.offset|)), 791#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)) (= (select |#valid| append_~plist.base) 1)), 792#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)))] [2018-02-04 02:01:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:14,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:01:14,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:01:14,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:01:14,810 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 7 states. [2018-02-04 02:01:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:15,019 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2018-02-04 02:01:15,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:01:15,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-02-04 02:01:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:15,020 INFO L225 Difference]: With dead ends: 135 [2018-02-04 02:01:15,021 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 02:01:15,021 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-04 02:01:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 02:01:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2018-02-04 02:01:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 02:01:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2018-02-04 02:01:15,027 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 13 [2018-02-04 02:01:15,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:15,028 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2018-02-04 02:01:15,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:01:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2018-02-04 02:01:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:01:15,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:15,028 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:01:15,029 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:15,029 INFO L82 PathProgramCache]: Analyzing trace with hash 132204114, now seen corresponding path program 1 times [2018-02-04 02:01:15,029 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:15,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:15,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:01:15,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,063 INFO L182 omatonBuilderFactory]: Interpolants [1056#false, 1057#(= 1 (select |#valid| |append_#t~malloc0.base|)), 1058#(= 1 (select |#valid| append_~item~0.base)), 1055#true] [2018-02-04 02:01:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:01:15,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:01:15,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:01:15,064 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 4 states. [2018-02-04 02:01:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:15,125 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-04 02:01:15,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:01:15,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 02:01:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:15,126 INFO L225 Difference]: With dead ends: 121 [2018-02-04 02:01:15,126 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 02:01:15,126 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-04 02:01:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 02:01:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-04 02:01:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 02:01:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2018-02-04 02:01:15,132 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 14 [2018-02-04 02:01:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:15,133 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2018-02-04 02:01:15,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:01:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2018-02-04 02:01:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:01:15,133 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:15,133 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:01:15,133 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash 132204115, now seen corresponding path program 1 times [2018-02-04 02:01:15,134 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:15,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:15,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:01:15,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,178 INFO L182 omatonBuilderFactory]: Interpolants [1303#true, 1304#false, 1305#(and (= 8 (select |#length| |append_#t~malloc0.base|)) (= 0 |append_#t~malloc0.offset|)), 1306#(and (= (select |#length| append_~item~0.base) 8) (= append_~item~0.offset 0))] [2018-02-04 02:01:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:01:15,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:01:15,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:01:15,179 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand 4 states. [2018-02-04 02:01:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:15,241 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-02-04 02:01:15,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:01:15,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 02:01:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:15,242 INFO L225 Difference]: With dead ends: 117 [2018-02-04 02:01:15,242 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 02:01:15,242 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-04 02:01:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 02:01:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-04 02:01:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 02:01:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-02-04 02:01:15,247 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 14 [2018-02-04 02:01:15,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:15,247 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-02-04 02:01:15,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:01:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-02-04 02:01:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 02:01:15,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:15,248 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:01:15,248 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:15,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1054600686, now seen corresponding path program 1 times [2018-02-04 02:01:15,249 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:15,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:15,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 02:01:15,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,324 INFO L182 omatonBuilderFactory]: Interpolants [1543#true, 1544#false, 1545#(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|))), 1546#(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|))), 1547#(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))), 1548#(and (= 0 |append_#t~mem2.base|) (= 0 |append_#t~mem2.offset|)), 1549#(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))), 1550#(and (= |append_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| append_~item~0.base) append_~item~0.offset)) (= |append_#t~mem3.base| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= 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)))] [2018-02-04 02:01:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:01:15,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:01:15,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:01:15,325 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 8 states. [2018-02-04 02:01:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:15,494 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-02-04 02:01:15,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:01:15,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 02:01:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:15,495 INFO L225 Difference]: With dead ends: 114 [2018-02-04 02:01:15,495 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 02:01:15,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:01:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 02:01:15,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 02:01:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 02:01:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-02-04 02:01:15,498 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 19 [2018-02-04 02:01:15,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:15,498 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-02-04 02:01:15,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:01:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-02-04 02:01:15,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:01:15,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:15,499 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] [2018-02-04 02:01:15,499 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:15,499 INFO L82 PathProgramCache]: Analyzing trace with hash -564310853, now seen corresponding path program 1 times [2018-02-04 02:01:15,503 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:15,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:15,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:01:15,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,618 INFO L182 omatonBuilderFactory]: Interpolants [1792#(and (= append_~plist.base |append_#in~plist.base|) (or (= append_~plist.offset 0) (= |append_#in~plist.offset| append_~plist.offset))), 1793#(or (<= 4 (select |#length| |append_#in~plist.base|)) (not (= |append_#in~plist.offset| 0))), 1794#(and (< 0 (+ |main_~#list~0.offset| 1)) (<= (+ |main_~#list~0.offset| 4) (select |#length| |main_~#list~0.base|))), 1789#true, 1790#false, 1791#(and (= 0 |main_~#list~0.offset|) (= (select |#length| |main_~#list~0.base|) 4))] [2018-02-04 02:01:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:01:15,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:01:15,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:01:15,619 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 6 states. [2018-02-04 02:01:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:15,698 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-02-04 02:01:15,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:01:15,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 02:01:15,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:15,699 INFO L225 Difference]: With dead ends: 115 [2018-02-04 02:01:15,699 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 02:01:15,699 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-04 02:01:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 02:01:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2018-02-04 02:01:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 02:01:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-02-04 02:01:15,702 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 27 [2018-02-04 02:01:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:15,702 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-02-04 02:01:15,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:01:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-02-04 02:01:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 02:01:15,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:15,702 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-04 02:01:15,702 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:15,703 INFO L82 PathProgramCache]: Analyzing trace with hash -882655928, now seen corresponding path program 1 times [2018-02-04 02:01:15,703 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:15,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:15,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:01:15,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,749 INFO L182 omatonBuilderFactory]: Interpolants [2020#true, 2021#false, 2022#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 2023#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 2024#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 2025#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 2026#(= 1 (select |#valid| |main_#t~mem12.base|))] [2018-02-04 02:01:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:01:15,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:01:15,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:01:15,750 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 7 states. [2018-02-04 02:01:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:15,853 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-02-04 02:01:15,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:01:15,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 02:01:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:15,854 INFO L225 Difference]: With dead ends: 129 [2018-02-04 02:01:15,854 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 02:01:15,855 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-04 02:01:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 02:01:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2018-02-04 02:01:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 02:01:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-02-04 02:01:15,859 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 30 [2018-02-04 02:01:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:15,859 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-02-04 02:01:15,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:01:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-02-04 02:01:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 02:01:15,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:15,860 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-04 02:01:15,860 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:15,860 INFO L82 PathProgramCache]: Analyzing trace with hash -882655927, now seen corresponding path program 1 times [2018-02-04 02:01:15,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:15,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:15,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 02:01:15,973 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,974 INFO L182 omatonBuilderFactory]: Interpolants [2272#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 2273#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 2274#(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))), 2275#(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|))), 2276#(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|))), 2277#(and (= |main_#t~mem12.offset| 0) (<= 8 (select |#length| |main_#t~mem12.base|))), 2269#true, 2270#false, 2271#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|))] [2018-02-04 02:01:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:15,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:01:15,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:01:15,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:01:15,975 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 9 states. [2018-02-04 02:01:16,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:16,200 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-02-04 02:01:16,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:01:16,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-04 02:01:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:16,201 INFO L225 Difference]: With dead ends: 135 [2018-02-04 02:01:16,201 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 02:01:16,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:01:16,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 02:01:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 106. [2018-02-04 02:01:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-04 02:01:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-04 02:01:16,203 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 30 [2018-02-04 02:01:16,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:16,203 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-04 02:01:16,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:01:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-04 02:01:16,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 02:01:16,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:16,204 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] [2018-02-04 02:01:16,204 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:16,204 INFO L82 PathProgramCache]: Analyzing trace with hash -575262126, now seen corresponding path program 1 times [2018-02-04 02:01:16,205 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:16,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:16,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:16,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:01:16,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:16,294 INFO L182 omatonBuilderFactory]: Interpolants [2533#true, 2534#false, 2535#(= 0 |main_~#list~0.offset|), 2536#(and (or (= append_~plist.offset 0) (= |append_#in~plist.offset| append_~plist.offset)) (or (= append_~plist.base |append_#in~plist.base|) (not (= append_~plist.offset 0)))), 2537#(or (not (= |append_#in~plist.offset| 0)) (and (= (select |#valid| |append_#in~plist.base|) 1) (<= 4 (select |#length| |append_#in~plist.base|)))), 2538#(and (<= 4 (select |#length| |main_~#list~0.base|)) (= 0 |main_~#list~0.offset|) (= (select |#valid| |main_~#list~0.base|) 1)), 2539#(and (= (select |#valid| |append_#in~plist.base|) 1) (<= 4 (select |#length| |append_#in~plist.base|)) (= 0 |append_#in~plist.offset|)), 2540#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)) (= (select |#valid| append_~plist.base) 1)), 2541#(and (= append_~plist.offset 0) (<= 4 (select |#length| append_~plist.base)))] [2018-02-04 02:01:16,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:16,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:01:16,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:01:16,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:01:16,294 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 9 states. [2018-02-04 02:01:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:16,472 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-02-04 02:01:16,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:01:16,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 02:01:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:16,476 INFO L225 Difference]: With dead ends: 103 [2018-02-04 02:01:16,476 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 02:01:16,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:01:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 02:01:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-02-04 02:01:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-04 02:01:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-02-04 02:01:16,480 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 32 [2018-02-04 02:01:16,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:16,480 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-02-04 02:01:16,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:01:16,480 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-02-04 02:01:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:01:16,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:16,481 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-04 02:01:16,481 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:16,481 INFO L82 PathProgramCache]: Analyzing trace with hash -552202616, now seen corresponding path program 1 times [2018-02-04 02:01:16,482 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:16,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:16,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:16,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:01:16,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:16,522 INFO L182 omatonBuilderFactory]: Interpolants [2747#true, 2748#false, 2749#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem11.offset|)), 2750#(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|))), 2751#(and (= 0 |main_#t~mem24.offset|) (= |main_#t~mem24.base| 0))] [2018-02-04 02:01:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:16,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:01:16,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:01:16,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:01:16,523 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 5 states. [2018-02-04 02:01:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:16,587 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-02-04 02:01:16,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:01:16,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-04 02:01:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:16,588 INFO L225 Difference]: With dead ends: 106 [2018-02-04 02:01:16,588 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 02:01:16,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:01:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 02:01:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-02-04 02:01:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 02:01:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-02-04 02:01:16,590 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 33 [2018-02-04 02:01:16,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:16,591 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-02-04 02:01:16,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:01:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-02-04 02:01:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:01:16,591 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:16,592 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-04 02:01:16,592 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1412958943, now seen corresponding path program 1 times [2018-02-04 02:01:16,592 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:16,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:16,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:16,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:01:16,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:16,622 INFO L182 omatonBuilderFactory]: Interpolants [2963#true, 2964#false, 2965#(= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 2966#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 2967#(= 1 (select |#valid| |main_#t~mem14.base|))] [2018-02-04 02:01:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:16,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:01:16,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:01:16,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:01:16,622 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 5 states. [2018-02-04 02:01:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:16,705 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-02-04 02:01:16,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:01:16,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-04 02:01:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:16,706 INFO L225 Difference]: With dead ends: 102 [2018-02-04 02:01:16,706 INFO L226 Difference]: Without dead ends: 102 [2018-02-04 02:01:16,706 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-04 02:01:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-04 02:01:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-02-04 02:01:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-04 02:01:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-02-04 02:01:16,709 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 33 [2018-02-04 02:01:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:16,709 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-02-04 02:01:16,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:01:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-02-04 02:01:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:01:16,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:16,710 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-04 02:01:16,710 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:16,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1412958942, now seen corresponding path program 1 times [2018-02-04 02:01:16,711 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:16,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:16,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-04 02:01:16,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:16,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 02:01:16,844 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:16,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-04 02:01:16,845 INFO L182 omatonBuilderFactory]: Interpolants [3184#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem12.offset| 0) (= |main_#t~mem12.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 3185#(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|)))), 3186#(and (<= 0 |main_#t~mem14.offset|) (<= (+ |main_#t~mem14.offset| 8) (select |#length| |main_#t~mem14.base|))), 3176#true, 3177#false, 3178#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 3179#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 3180#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 3181#(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))), 3182#(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|))), 3183#(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|)))] [2018-02-04 02:01:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:16,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:01:16,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:01:16,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:01:16,845 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 11 states. [2018-02-04 02:01:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:17,027 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-02-04 02:01:17,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:01:17,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-02-04 02:01:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:17,027 INFO L225 Difference]: With dead ends: 104 [2018-02-04 02:01:17,028 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 02:01:17,028 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-04 02:01:17,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 02:01:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-02-04 02:01:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 02:01:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-02-04 02:01:17,030 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 33 [2018-02-04 02:01:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:17,031 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-02-04 02:01:17,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:01:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-02-04 02:01:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 02:01:17,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:17,032 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-04 02:01:17,032 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:17,032 INFO L82 PathProgramCache]: Analyzing trace with hash -852054260, now seen corresponding path program 1 times [2018-02-04 02:01:17,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:17,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:17,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:17,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 02:01:17,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:17,251 INFO L182 omatonBuilderFactory]: Interpolants [3406#true, 3407#false, 3408#(= (select |#valid| |main_~#list~0.base|) 1), 3409#(= |#valid| |old(#valid)|), 3410#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 3411#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 3412#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.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|)), 3413#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.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|) (= 0 |append_#t~malloc6.offset|)), 3414#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.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|) (= 0 |append_#t~ite7.offset|)), 3415#(and (= 0 append_~item~0.offset) (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|) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 3416#(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|))), 3417#(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))), 3418#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) 4))), 3419#(and (= 0 |main_#t~mem14.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4)))), 3420#(= |main_#t~mem15.offset| 0)] [2018-02-04 02:01:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:17,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:01:17,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:01:17,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:01:17,251 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 15 states. [2018-02-04 02:01:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:17,617 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-02-04 02:01:17,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 02:01:17,617 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-02-04 02:01:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:17,618 INFO L225 Difference]: With dead ends: 139 [2018-02-04 02:01:17,618 INFO L226 Difference]: Without dead ends: 139 [2018-02-04 02:01:17,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:01:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-04 02:01:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2018-02-04 02:01:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 02:01:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-02-04 02:01:17,621 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 34 [2018-02-04 02:01:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:17,621 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-02-04 02:01:17,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:01:17,622 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-02-04 02:01:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 02:01:17,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:17,622 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-04 02:01:17,623 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash -852054259, now seen corresponding path program 1 times [2018-02-04 02:01:17,624 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:17,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:17,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:17,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 02:01:17,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:17,830 INFO L182 omatonBuilderFactory]: Interpolants [3712#(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)))), 3713#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) 4)))), 3714#(and (= 0 |main_#t~mem14.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4))))), 3715#(= 1 (select |#valid| |main_#t~mem15.base|)), 3701#true, 3702#false, 3703#(= (select |#valid| |main_~#list~0.base|) 1), 3704#(= |#valid| |old(#valid)|), 3705#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 3706#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 3707#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.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|)), 3708#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| |append_#t~malloc6.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|)), 3709#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| |append_#t~ite7.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|)), 3710#(and (or (= append_~plist.base append_~item~0.base) (and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.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_~plist.offset |append_#in~plist.offset|))) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|)))), 3711#(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))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))))] [2018-02-04 02:01:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:17,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:01:17,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:01:17,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:01:17,831 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 15 states. [2018-02-04 02:01:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:18,406 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-02-04 02:01:18,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:01:18,407 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-02-04 02:01:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:18,407 INFO L225 Difference]: With dead ends: 142 [2018-02-04 02:01:18,407 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 02:01:18,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2018-02-04 02:01:18,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 02:01:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2018-02-04 02:01:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 02:01:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-02-04 02:01:18,410 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 34 [2018-02-04 02:01:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:18,411 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-02-04 02:01:18,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:01:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-02-04 02:01:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 02:01:18,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:18,412 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-04 02:01:18,412 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1908491397, now seen corresponding path program 1 times [2018-02-04 02:01:18,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:18,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:18,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:18,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 02:01:18,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:18,480 INFO L182 omatonBuilderFactory]: Interpolants [4003#true, 4004#false, 4005#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 4006#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|)), 4007#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 4008#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 4009#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 4010#(not (= 0 |main_#t~mem11.base|))] [2018-02-04 02:01:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:18,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:01:18,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:01:18,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:01:18,481 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 8 states. [2018-02-04 02:01:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:18,599 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-02-04 02:01:18,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:01:18,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-04 02:01:18,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:18,600 INFO L225 Difference]: With dead ends: 108 [2018-02-04 02:01:18,600 INFO L226 Difference]: Without dead ends: 108 [2018-02-04 02:01:18,600 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:01:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-04 02:01:18,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-04 02:01:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 02:01:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-02-04 02:01:18,602 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 35 [2018-02-04 02:01:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:18,603 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-02-04 02:01:18,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:01:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-02-04 02:01:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 02:01:18,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:18,604 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:01:18,604 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:18,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1514610189, now seen corresponding path program 1 times [2018-02-04 02:01:18,604 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:18,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:18,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:18,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 02:01:18,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:18,893 INFO L182 omatonBuilderFactory]: Interpolants [4237#true, 4238#false, 4239#(= 1 (select |#valid| |main_~#list~0.base|)), 4240#(= |#valid| |old(#valid)|), 4241#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 4242#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 4243#(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|)), 4244#(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)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 4245#(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_~plist.base |append_#t~malloc6.base|)) (= append_~plist.offset |append_#in~plist.offset|)), 4246#(and (= append_~plist.base |append_#in~plist.base|) (not (= append_~plist.base |append_#t~ite7.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|)), 4247#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (not (= append_~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)) (and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#in~plist.base|))))), 4248#(and (= 1 (select |#valid| |append_#in~plist.base|)) (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))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))))), 4249#(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|))), 4250#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4)))) (= 0 |main_#t~mem14.offset|) (= 1 (select |#valid| |main_~#list~0.base|))), 4251#(= 1 (select (store |#valid| |main_#t~mem15.base| 0) |main_~#list~0.base|))] [2018-02-04 02:01:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:18,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:01:18,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:01:18,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:01:18,894 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 15 states. [2018-02-04 02:01:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:19,473 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-02-04 02:01:19,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 02:01:19,473 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-02-04 02:01:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:19,474 INFO L225 Difference]: With dead ends: 151 [2018-02-04 02:01:19,474 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 02:01:19,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:01:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 02:01:19,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 125. [2018-02-04 02:01:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 02:01:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-02-04 02:01:19,477 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 36 [2018-02-04 02:01:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:19,477 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-02-04 02:01:19,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:01:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-02-04 02:01:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 02:01:19,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:19,477 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-04 02:01:19,477 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash -291724377, now seen corresponding path program 1 times [2018-02-04 02:01:19,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:19,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:19,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:19,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:01:19,528 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:19,529 INFO L182 omatonBuilderFactory]: Interpolants [4560#true, 4561#false, 4562#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 4563#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 4564#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 4565#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)), 4566#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 4567#(= |main_#t~mem16.offset| 0)] [2018-02-04 02:01:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:19,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:01:19,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:01:19,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:01:19,529 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 8 states. [2018-02-04 02:01:19,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:19,634 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-02-04 02:01:19,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:01:19,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-02-04 02:01:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:19,635 INFO L225 Difference]: With dead ends: 124 [2018-02-04 02:01:19,635 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 02:01:19,635 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-04 02:01:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 02:01:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 02:01:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 02:01:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-02-04 02:01:19,638 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 37 [2018-02-04 02:01:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:19,639 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-02-04 02:01:19,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:01:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-02-04 02:01:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 02:01:19,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:19,639 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-04 02:01:19,639 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:19,639 INFO L82 PathProgramCache]: Analyzing trace with hash -291724376, now seen corresponding path program 1 times [2018-02-04 02:01:19,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:19,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:19,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:19,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 02:01:19,903 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:19,904 INFO L182 omatonBuilderFactory]: Interpolants [4832#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (not (= append_~item~0.base |append_#t~malloc6.base|)) (= append_~plist.offset |append_#in~plist.offset|)), 4833#(and (not (= append_~item~0.base |append_#t~ite7.base|)) (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 4834#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.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_~plist.offset |append_#in~plist.offset|)), 4835#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (or (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))) (= |append_#in~plist.base| (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|))), 4836#(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|)))), 4837#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem14.offset| 0) (= |main_#t~mem14.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|)))), 4838#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (= 1 (select (store |#valid| |main_#t~mem15.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|)))), 4839#(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|))), 4840#(= (select |#valid| |main_#t~mem16.base|) 1), 4826#true, 4827#false, 4828#(and (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 4829#(and (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base) (= 0 |append_#t~malloc0.offset|)), 4830#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 4831#(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|))] [2018-02-04 02:01:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:19,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:01:19,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:01:19,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:01:19,905 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 15 states. [2018-02-04 02:01:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:20,342 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-02-04 02:01:20,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 02:01:20,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-02-04 02:01:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:20,343 INFO L225 Difference]: With dead ends: 134 [2018-02-04 02:01:20,343 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 02:01:20,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:01:20,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 02:01:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2018-02-04 02:01:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 02:01:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-02-04 02:01:20,346 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 37 [2018-02-04 02:01:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:20,347 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-02-04 02:01:20,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:01:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-02-04 02:01:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:01:20,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:20,347 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] [2018-02-04 02:01:20,347 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:20,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1900218884, now seen corresponding path program 1 times [2018-02-04 02:01:20,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:20,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:20,480 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-04 02:01:20,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:20,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:01:20,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:20,481 INFO L182 omatonBuilderFactory]: Interpolants [5136#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset))), 5137#(= (select |#valid| |append_#t~mem4.base|) 1), 5126#true, 5127#false, 5128#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 5129#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 5130#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 5131#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 5132#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))), 5133#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))) (= |append_#t~malloc0.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))), 5134#(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)))), 5135#(or (= append_~item~0.base |append_#t~mem2.base|) (= 1 (select |#valid| |append_#t~mem2.base|)))] [2018-02-04 02:01:20,481 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-04 02:01:20,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:01:20,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:01:20,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:01:20,482 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 12 states. [2018-02-04 02:01:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:20,842 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-02-04 02:01:20,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:01:20,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-02-04 02:01:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:20,843 INFO L225 Difference]: With dead ends: 124 [2018-02-04 02:01:20,843 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 02:01:20,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:01:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 02:01:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 02:01:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 02:01:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-02-04 02:01:20,846 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 38 [2018-02-04 02:01:20,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:20,846 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-02-04 02:01:20,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:01:20,847 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-02-04 02:01:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:01:20,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:20,847 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] [2018-02-04 02:01:20,847 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:20,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1900218883, now seen corresponding path program 1 times [2018-02-04 02:01:20,848 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:20,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:21,020 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-04 02:01:21,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:21,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:01:21,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:21,021 INFO L182 omatonBuilderFactory]: Interpolants [5408#(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|))), 5409#(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)), 5410#(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))), 5411#(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))), 5412#(and (<= 8 (select |#length| |append_#t~mem2.base|)) (= 0 |append_#t~mem2.offset|)), 5413#(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)))), 5414#(and (<= 8 (select |#length| |append_#t~mem4.base|)) (= |append_#t~mem4.offset| 0)), 5402#true, 5403#false, 5404#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 5405#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 5406#(and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)), 5407#(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)))] [2018-02-04 02:01:21,021 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-04 02:01:21,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:01:21,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:01:21,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:01:21,022 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 13 states. [2018-02-04 02:01:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:21,437 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-02-04 02:01:21,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:01:21,437 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-02-04 02:01:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:21,437 INFO L225 Difference]: With dead ends: 123 [2018-02-04 02:01:21,437 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 02:01:21,438 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-04 02:01:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 02:01:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-04 02:01:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 02:01:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-02-04 02:01:21,439 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 38 [2018-02-04 02:01:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:21,439 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-02-04 02:01:21,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:01:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-02-04 02:01:21,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 02:01:21,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:21,440 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:01:21,440 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:21,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1174251320, now seen corresponding path program 1 times [2018-02-04 02:01:21,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:21,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:21,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:21,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 02:01:21,550 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:21,551 INFO L182 omatonBuilderFactory]: Interpolants [5696#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 5697#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |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|)))), 5698#(and (or (not (= |main_#t~mem16.offset| 0)) (not (= |main_#t~mem16.base| 0))) (not (= |main_~#list~0.base| |main_#t~mem16.base|)) (= 1 (select |#valid| |main_~#list~0.base|))), 5687#true, 5688#false, 5689#(= 1 (select |#valid| |main_~#list~0.base|)), 5690#(= |#valid| |old(#valid)|), 5691#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 5692#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|)), 5693#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 5694#(= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 5695#(not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))] [2018-02-04 02:01:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:21,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:01:21,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:01:21,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:01:21,552 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 12 states. [2018-02-04 02:01:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:21,761 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-04 02:01:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:01:21,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-02-04 02:01:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:21,761 INFO L225 Difference]: With dead ends: 130 [2018-02-04 02:01:21,761 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 02:01:21,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:01:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 02:01:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-02-04 02:01:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 02:01:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2018-02-04 02:01:21,764 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 39 [2018-02-04 02:01:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:21,765 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2018-02-04 02:01:21,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:01:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2018-02-04 02:01:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 02:01:21,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:21,765 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:01:21,765 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:21,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1194268638, now seen corresponding path program 1 times [2018-02-04 02:01:21,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:21,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:22,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:22,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 02:01:22,305 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:22,305 INFO L182 omatonBuilderFactory]: Interpolants [5984#(or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 5985#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem24.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem24.base| 0)), 5967#true, 5968#false, 5969#(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|))), 5970#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5971#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5972#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5973#(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 (= 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|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))), 5974#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| 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|) (= (select (select |#memory_$Pointer$.base| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem2.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (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|)))), 5975#(and (or (= append_~plist.base append_~item~0.base) (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|) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|))) (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|)))), 5976#(or (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 0) (select (select |old(#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| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 0)))), 5977#(or (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 5978#(or (and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem11.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|))) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)))), 5979#(or (and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 0)))), 5980#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|)))), 5981#(or (and (= 0 |main_#t~mem13.offset|) (= 0 |main_#t~mem13.base|)) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 5982#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 5983#(or (and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)) (not (= 0 |main_#t~mem16.offset|)) (and (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_#t~mem16.base| 0))))] [2018-02-04 02:01:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:22,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 02:01:22,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 02:01:22,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:01:22,306 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand 19 states. [2018-02-04 02:01:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:22,897 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-02-04 02:01:22,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:01:22,897 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-02-04 02:01:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:22,898 INFO L225 Difference]: With dead ends: 138 [2018-02-04 02:01:22,898 INFO L226 Difference]: Without dead ends: 138 [2018-02-04 02:01:22,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:01:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-04 02:01:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2018-02-04 02:01:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-04 02:01:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-02-04 02:01:22,901 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 44 [2018-02-04 02:01:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:22,901 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-02-04 02:01:22,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 02:01:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-02-04 02:01:22,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 02:01:22,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:22,901 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:01:22,901 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:22,901 INFO L82 PathProgramCache]: Analyzing trace with hash -936632417, now seen corresponding path program 1 times [2018-02-04 02:01:22,902 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:22,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:23,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:23,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 02:01:23,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:23,855 INFO L182 omatonBuilderFactory]: Interpolants [6279#true, 6280#false, 6281#(= |#valid| |old(#valid)|), 6282#(= (store |#valid| |main_~#list~0.base| 0) |old(#valid)|), 6283#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 6284#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= |old(#valid)| (store |#valid| |append_#t~malloc0.base| (select |old(#valid)| |append_#t~malloc0.base|))) (= 0 |append_#t~malloc0.offset|)), 6285#(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))), 6286#(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)|) (= (select |#valid| append_~plist.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 6287#(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) (= (select |#valid| append_~plist.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 6288#(and (= 0 append_~item~0.offset) (= 0 (select |old(#valid)| |append_#t~malloc6.base|)) (not (= append_~plist.base |append_#t~malloc6.base|)) (not (= append_~item~0.base |append_#t~malloc6.base|)) (not (= |append_#t~malloc6.base| 0)) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base) (= 0 (select |old(#valid)| append_~item~0.base)) (= (store (store |#valid| append_~item~0.base (select |old(#valid)| append_~item~0.base)) |append_#t~malloc6.base| (select |old(#valid)| |append_#t~malloc6.base|)) |old(#valid)|)), 6289#(and (not (= |append_#in~plist.base| |append_#t~ite7.base|)) (not (= append_~item~0.base |append_#t~ite7.base|)) (= append_~plist.base |append_#in~plist.base|) (= |old(#valid)| (store (store |#valid| append_~item~0.base (select |old(#valid)| append_~item~0.base)) |append_#t~ite7.base| (select |old(#valid)| |append_#t~ite7.base|))) (= 0 (select |old(#valid)| |append_#t~ite7.base|)) (= append_~item~0.offset 0) (not (= |append_#t~ite7.base| 0)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 6290#(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 (= append_~plist.base |append_#in~plist.base|) (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)))) (= 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 (= (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)) (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_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))))), 6291#(or (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 (= |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))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 4) 0))) (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.base|)), 6292#(or (and (= (store (store (store |#valid| |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| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) 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 (= |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|))), 6293#(and (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem11.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (= (store (store (store |#valid| |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| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) 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 (= |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|)))), 6294#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))) (or (and (= (store (store (store |#valid| |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| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) 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 (= |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|)))), 6295#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))) (or (and (= |old(#valid)| (store (store (store |#valid| |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) 4) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4) 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 (= |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|)))), 6296#(and (or (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4)))) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4)))) (= |old(#valid)| (store (store (store |#valid| |main_~#list~0.base| 0) (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4)) 0) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4)) 0))) (not (= |main_#t~mem14.offset| 0))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0))) (or (= |main_#t~mem14.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem14.offset| 0))), 6297#(and (or (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (not (= |main_#t~mem15.base| 0)) (= (store (store (store |#valid| |main_~#list~0.base| 0) |main_#t~mem15.base| (select (store |#valid| |main_#t~mem15.base| 0) |main_#t~mem15.base|)) (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0) |old(#valid)|) (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) |main_#t~mem15.base|)) (not (= |main_#t~mem15.base| |main_~#list~0.base|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)))), 6298#(and (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)|) (not (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|) 0)))), 6299#(and (or (and (not (= |main_#t~mem16.base| |main_~#list~0.base|)) (= (store (store |#valid| |main_~#list~0.base| 0) |main_#t~mem16.base| (select (store |#valid| |main_#t~mem16.base| 0) |main_#t~mem16.base|)) |old(#valid)|)) (and (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 |main_#t~mem16.offset|))) (or (not (= |main_#t~mem16.offset| 0)) (not (= |main_#t~mem16.base| 0)))), 6300#(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-04 02:01:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:23,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:01:23,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:01:23,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:01:23,856 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 22 states. [2018-02-04 02:01:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:24,857 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-02-04 02:01:24,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 02:01:24,859 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-02-04 02:01:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:24,860 INFO L225 Difference]: With dead ends: 137 [2018-02-04 02:01:24,860 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 02:01:24,860 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 02:01:24,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 02:01:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-02-04 02:01:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 02:01:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-04 02:01:24,863 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 46 [2018-02-04 02:01:24,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:24,863 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-04 02:01:24,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:01:24,863 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-04 02:01:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 02:01:24,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:24,864 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:01:24,864 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:24,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1548731934, now seen corresponding path program 1 times [2018-02-04 02:01:24,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:24,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:24,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:24,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:01:24,978 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:24,979 INFO L182 omatonBuilderFactory]: Interpolants [6592#(= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem3.base|), 6593#(= 0 (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)), 6581#true, 6582#false, 6583#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 6584#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|)), 6585#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 6586#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 6587#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 6588#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 6589#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|)), 6590#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem2.base|)), 6591#(= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset))] [2018-02-04 02:01:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:24,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:01:24,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:01:24,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:01:24,980 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 13 states. [2018-02-04 02:01:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:25,247 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-02-04 02:01:25,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 02:01:25,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-02-04 02:01:25,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:25,248 INFO L225 Difference]: With dead ends: 102 [2018-02-04 02:01:25,248 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 02:01:25,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-02-04 02:01:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 02:01:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-04 02:01:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 02:01:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-02-04 02:01:25,249 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 53 [2018-02-04 02:01:25,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:25,249 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-02-04 02:01:25,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:01:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-02-04 02:01:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 02:01:25,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:25,250 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:25,250 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2027547752, now seen corresponding path program 1 times [2018-02-04 02:01:25,251 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:25,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:26,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:26,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:01:26,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:26,033 INFO L182 omatonBuilderFactory]: Interpolants [6848#(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))), 6849#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) 4))), 6850#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4))) (= |main_#t~mem14.offset| 0)), 6851#(= |main_#t~mem15.offset| 0), 6825#true, 6826#false, 6827#(= (select |#valid| |main_~#list~0.base|) 1), 6828#(= |#valid| |old(#valid)|), 6829#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 6830#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 6831#(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) (= append_~plist.offset |append_#in~plist.offset|)))), 6832#(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) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc6.offset|)))), 6833#(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) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~ite7.offset|)))), 6834#(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|)))), 6835#(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|))), 6836#(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)), 6837#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6838#(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)|)), 6839#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6840#(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)|)), 6841#(and (= append_~plist.base |append_#in~plist.base|) (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem2.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)|) (= |append_#t~mem2.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))), 6842#(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))), 6843#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem4.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (or (= append_~item~0.base |append_#t~mem4.base|) (= (select |#memory_$Pointer$.offset| |append_#t~mem4.base|) (select |old(#memory_$Pointer$.offset)| |append_#t~mem4.base|))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (or (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem4.offset|) (= |append_#t~mem4.offset| 0))), 6844#(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 (= 0 append_~item~0.offset) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~mem5.offset|)))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 6845#(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 (= 0 append_~item~0.offset) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~ite7.offset|)))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 6846#(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 (= 0 append_~item~0.offset) (or (= append_~plist.base append_~item~0.base) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (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_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 6847#(or (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (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)| |append_#in~plist.base|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))))] [2018-02-04 02:01:26,034 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:26,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 02:01:26,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 02:01:26,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:01:26,034 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 27 states. [2018-02-04 02:01:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:28,046 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2018-02-04 02:01:28,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-04 02:01:28,046 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2018-02-04 02:01:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:28,047 INFO L225 Difference]: With dead ends: 142 [2018-02-04 02:01:28,047 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 02:01:28,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=424, Invalid=3736, Unknown=0, NotChecked=0, Total=4160 [2018-02-04 02:01:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 02:01:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 107. [2018-02-04 02:01:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 02:01:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-02-04 02:01:28,050 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 54 [2018-02-04 02:01:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:28,050 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-02-04 02:01:28,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 02:01:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-02-04 02:01:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 02:01:28,052 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:28,052 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:28,052 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:28,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2027547751, now seen corresponding path program 1 times [2018-02-04 02:01:28,053 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:28,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:29,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:29,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 02:01:29,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:29,094 INFO L182 omatonBuilderFactory]: Interpolants [7177#true, 7178#false, 7179#(= (select |#valid| |main_~#list~0.base|) 1), 7180#(= |#valid| |old(#valid)|), 7181#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 7182#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 7183#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.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|)), 7184#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| |append_#t~malloc6.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|)), 7185#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| |append_#t~ite7.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|)), 7186#(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 (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.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)))) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|)))), 7187#(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 (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 0 (select |old(#valid)| |append_#in~plist.base|))), 7188#(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)), 7189#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7190#(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)|)), 7191#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| (store |old(#valid)| |append_#t~malloc0.base| (select |#valid| |append_#t~malloc0.base|))) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7192#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (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|))))), 7193#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem2.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)|) (= |append_#t~mem2.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 7194#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (or (= |#valid| |old(#valid)|) (= append_~item~0.base (@diff |old(#valid)| |#valid|))) (= |#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)) (= (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|))))), 7195#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem4.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (or (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem4.offset|) (= 0 |append_#t~mem4.offset|)) (or (= append_~item~0.base |append_#t~mem4.base|) (= (select |#memory_$Pointer$.base| |append_#t~mem4.base|) (select |old(#memory_$Pointer$.base)| |append_#t~mem4.base|))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (or (not (= 0 |append_#t~mem4.offset|)) (and (or (= |#valid| |old(#valid)|) (= append_~item~0.base (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))))), 7196#(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 (= 0 append_~item~0.offset) (or (and (or (= |#valid| |old(#valid)|) (= append_~item~0.base (@diff |old(#valid)| |#valid|))) (= |append_#t~mem5.base| (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|))))) (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))), 7197#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (and (= 0 append_~item~0.offset) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= |#valid| |old(#valid)|) (= append_~item~0.base (@diff |old(#valid)| |#valid|))) (= |append_#t~ite7.base| (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|))))))))), 7198#(and (or (= append_~plist.base append_~item~0.base) (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (and (= 0 append_~item~0.offset) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= |#valid| |old(#valid)|) (= append_~item~0.base (@diff |old(#valid)| |#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_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 7199#(or (and (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (or (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|) (@diff |old(#valid)| |#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 (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|))) (= 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|))), 7200#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))), 7201#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (or (and (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) 4)))) (and (= |main_#t~mem12.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) 4))))), 7202#(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)))), 7203#(and (= 0 |main_#t~mem14.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4))))), 7204#(= 1 (select |#valid| |main_#t~mem15.base|))] [2018-02-04 02:01:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:29,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 02:01:29,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 02:01:29,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:01:29,094 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 28 states. [2018-02-04 02:01:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:31,273 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-02-04 02:01:31,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 02:01:31,274 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-02-04 02:01:31,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:31,274 INFO L225 Difference]: With dead ends: 123 [2018-02-04 02:01:31,274 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 02:01:31,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=325, Invalid=2981, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 02:01:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 02:01:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 107. [2018-02-04 02:01:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 02:01:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-02-04 02:01:31,276 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 54 [2018-02-04 02:01:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:31,276 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-02-04 02:01:31,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 02:01:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-02-04 02:01:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 02:01:31,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:31,277 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:31,277 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:31,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1441763225, now seen corresponding path program 1 times [2018-02-04 02:01:31,277 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:31,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:32,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:32,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 02:01:32,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:32,002 INFO L182 omatonBuilderFactory]: Interpolants [7495#true, 7496#false, 7497#(= 1 (select |#valid| |main_~#list~0.base|)), 7498#(= |#valid| |old(#valid)|), 7499#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 7500#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 7501#(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|)), 7502#(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)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= append_~plist.offset |append_#in~plist.offset|)), 7503#(and (= append_~item~0.offset 0) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (not (= append_~plist.base |append_#t~malloc6.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 7504#(and (not (= |append_#in~plist.base| |append_#t~ite7.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|)), 7505#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (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|))) (= 1 (select |#valid| append_~item~0.base)) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|)))), 7506#(or (= 0 (select |old(#valid)| |append_#in~plist.base|)) (and (= (select |#valid| |append_#in~plist.base|) 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (not (= |append_#in~plist.base| (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|)))), 7507#(and (= 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|))) (= (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)))), 7508#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7509#(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)|)), 7510#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7511#(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)|)), 7512#(and (= append_~plist.base |append_#in~plist.base|) (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem2.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)|) (= |append_#t~mem2.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))), 7513#(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))), 7514#(and (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem4.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= 1 (select |#valid| append_~plist.base)) (or (= append_~item~0.base |append_#t~mem4.base|) (= (select |#memory_$Pointer$.base| |append_#t~mem4.base|) (select |old(#memory_$Pointer$.base)| |append_#t~mem4.base|))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (or (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem4.offset|) (= |append_#t~mem4.offset| 0))), 7515#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~plist.base)) (or (and (or (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~mem5.base|)) (= append_~item~0.offset 0)) (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 7516#(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)) (and (or (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~ite7.base|)) (= append_~item~0.offset 0))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 7517#(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 (= append_~plist.base append_~item~0.base) (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)))) (= append_~item~0.offset 0))) (= 1 (select |#valid| append_~plist.base)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 7518#(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|))) (= 0 (select |old(#valid)| |append_#in~plist.base|)) (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)) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)))) (= 1 (select |#valid| |append_#in~plist.base|))), 7519#(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|))), 7520#(and (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4)))) (= 0 |main_#t~mem14.offset|) (= 1 (select |#valid| |main_~#list~0.base|))), 7521#(= 1 (select (store |#valid| |main_#t~mem15.base| 0) |main_~#list~0.base|))] [2018-02-04 02:01:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:32,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 02:01:32,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 02:01:32,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2018-02-04 02:01:32,003 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 27 states. [2018-02-04 02:01:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:33,790 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-02-04 02:01:33,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 02:01:33,790 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2018-02-04 02:01:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:33,791 INFO L225 Difference]: With dead ends: 125 [2018-02-04 02:01:33,791 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 02:01:33,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=357, Invalid=2613, Unknown=0, NotChecked=0, Total=2970 [2018-02-04 02:01:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 02:01:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 109. [2018-02-04 02:01:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 02:01:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-02-04 02:01:33,794 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 56 [2018-02-04 02:01:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:33,794 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-02-04 02:01:33,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 02:01:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-02-04 02:01:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 02:01:33,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:33,794 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:33,795 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:33,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1744987036, now seen corresponding path program 1 times [2018-02-04 02:01:33,795 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:33,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:34,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:34,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 02:01:34,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:34,536 INFO L182 omatonBuilderFactory]: Interpolants [7812#true, 7813#false, 7814#(= 1 (select |#valid| |main_~#list~0.base|)), 7815#(= |#valid| |old(#valid)|), 7816#(and (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 7817#(and (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base) (= 0 |append_#t~malloc0.offset|) (= (select |old(#valid)| |append_#t~malloc0.base|) 0)), 7818#(and (= 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|) (= |append_#in~plist.base| append_~plist.base)), 7819#(and (= append_~item~0.offset 0) (= 1 (select |#valid| |append_#t~malloc6.base|)) (or (not (= append_~plist.base append_~item~0.base)) (= (select |old(#valid)| |append_#in~plist.base|) 0)) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)), 7820#(and (= 1 (select |#valid| |append_#t~ite7.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|) (= |append_#in~plist.base| append_~plist.base)), 7821#(and (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)))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base))) (= 1 (select |#valid| append_~item~0.base)) (or (not (= append_~plist.base append_~item~0.base)) (= (select |old(#valid)| |append_#in~plist.base|) 0))), 7822#(or (= (select |old(#valid)| |append_#in~plist.base|) 0) (and (= 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|))) (= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)))), 7823#(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))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7824#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7825#(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)|)), 7826#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| |append_#t~malloc0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|) (= (select |old(#valid)| |append_#t~malloc0.base|) 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7827#(and (= append_~plist.base |append_#in~plist.base|) (= 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|) (= (select |old(#valid)| append_~item~0.base) 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7828#(and (= append_~plist.base |append_#in~plist.base|) (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem2.offset|) (= 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|) (= (select |old(#valid)| append_~item~0.base) 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |append_#t~mem2.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))), 7829#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.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|) (= (select |old(#valid)| append_~item~0.base) 0) (= (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))), 7830#(and (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem4.base| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (= 1 (select |#valid| append_~item~0.base)) (or (= append_~item~0.base |append_#t~mem4.base|) (= (select |#memory_$Pointer$.base| |append_#t~mem4.base|) (select |old(#memory_$Pointer$.base)| |append_#t~mem4.base|))) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|) (= (select |old(#valid)| append_~item~0.base) 0) (or (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem4.offset|) (= |append_#t~mem4.offset| 0))), 7831#(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 (= append_~item~0.offset 0) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= |append_#t~mem5.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4))))) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|) (= (select |old(#valid)| append_~item~0.base) 0)), 7832#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|) (= (select |old(#valid)| append_~item~0.base) 0) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (and (= append_~item~0.offset 0) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= |append_#t~ite7.base| (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4)))))), 7833#(and (= append_~plist.base |append_#in~plist.base|) (= 1 (select |#valid| append_~item~0.base)) (or (= append_~item~0.base (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) (and (= append_~item~0.offset 0) (or (= append_~plist.base append_~item~0.base) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 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)) (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4))))) (= append_~plist.offset |append_#in~plist.offset|) (= (select |old(#valid)| append_~item~0.base) 0)), 7834#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (or (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 (= (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|)))) (= (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) 0))), 7835#(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|)))), 7836#(and (or (not (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|) (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem14.offset| 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 7837#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (= 1 (select (store |#valid| |main_#t~mem15.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|)))), 7838#(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|))), 7839#(= (select |#valid| |main_#t~mem16.base|) 1)] [2018-02-04 02:01:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:34,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 02:01:34,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 02:01:34,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-02-04 02:01:34,536 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 28 states. [2018-02-04 02:01:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:36,155 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2018-02-04 02:01:36,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:01:36,156 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 57 [2018-02-04 02:01:36,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:36,156 INFO L225 Difference]: With dead ends: 124 [2018-02-04 02:01:36,156 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 02:01:36,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=313, Invalid=2879, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 02:01:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 02:01:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2018-02-04 02:01:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 02:01:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2018-02-04 02:01:36,159 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 57 [2018-02-04 02:01:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:36,159 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2018-02-04 02:01:36,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 02:01:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2018-02-04 02:01:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 02:01:36,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:36,160 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:36,160 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:36,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1895295932, now seen corresponding path program 1 times [2018-02-04 02:01:36,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:36,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:36,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:36,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:01:36,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:36,323 INFO L182 omatonBuilderFactory]: Interpolants [8132#true, 8133#false, 8134#(= append_~plist.base |append_#in~plist.base|), 8135#(= 1 (select |#valid| |append_#in~plist.base|)), 8136#(= 1 (select |#valid| |main_~#list~0.base|)), 8137#(= |#valid| |old(#valid)|), 8138#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 8139#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 |append_#t~malloc0.base|)) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|)), 8140#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 8141#(and (not (= 0 (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|)))), 8142#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8143#(and (not (= 0 |main_#t~mem16.base|)) (not (= |main_~#list~0.base| |main_#t~mem16.base|)) (= 1 (select |#valid| |main_~#list~0.base|)))] [2018-02-04 02:01:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:36,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:01:36,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:01:36,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:01:36,327 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand 12 states. [2018-02-04 02:01:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:36,579 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-02-04 02:01:36,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:01:36,579 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-02-04 02:01:36,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:36,579 INFO L225 Difference]: With dead ends: 109 [2018-02-04 02:01:36,579 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 02:01:36,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-02-04 02:01:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 02:01:36,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-02-04 02:01:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 02:01:36,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2018-02-04 02:01:36,582 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 59 [2018-02-04 02:01:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:36,582 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2018-02-04 02:01:36,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:01:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-02-04 02:01:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 02:01:36,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:36,583 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:36,583 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash -689631826, now seen corresponding path program 1 times [2018-02-04 02:01:36,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:36,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:37,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:37,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-04 02:01:37,734 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:37,735 INFO L182 omatonBuilderFactory]: Interpolants [8384#(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|)), 8385#(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~malloc6.base|)) (= append_~plist.offset |append_#in~plist.offset|)), 8386#(and (not (= append_~item~0.base |append_#t~ite7.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|)), 8387#(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|)), 8388#(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|))) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1)), 8389#(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)), 8390#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8391#(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)|)), 8392#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 |append_#t~malloc0.base|)) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8393#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 append_~item~0.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)|)), 8394#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem2.offset|) (not (= 0 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)|) (= |append_#t~mem2.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset))), 8395#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 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|)) (= 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)) (= (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))), 8396#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= |append_#t~mem4.base| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (or (= append_~item~0.base |append_#t~mem4.base|) (= (select |#memory_$Pointer$.base| |append_#t~mem4.base|) (select |old(#memory_$Pointer$.base)| |append_#t~mem4.base|))) (= append_~item~0.offset 0) (= |append_#t~mem4.base| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (or (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem4.offset|) (= |append_#t~mem4.offset| 0))), 8397#(and (= append_~plist.base |append_#in~plist.base|) (= 0 append_~item~0.offset) (not (= 0 append_~item~0.base)) (= 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|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.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)) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~mem5.base|))), 8398#(and (= 0 append_~item~0.offset) (= 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)) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| append_~plist.base) append_~plist.offset)) 4) |append_#t~ite7.base|)) (not (= 0 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|)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| append_~item~0.base) (+ append_~item~0.offset 4) |append_#t~ite7.base|) append_~item~0.offset))) (= append_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base))), 8399#(and (not (= 0 append_~item~0.base)) (or (not (= append_~plist.base append_~item~0.base)) (= append_~item~0.base |append_#in~plist.base|)) (or (= append_~plist.base append_~item~0.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))) (= 0 (select |old(#valid)| append_~item~0.base)))) (= append_~plist.offset |append_#in~plist.offset|)), 8400#(and (not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))) (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|)))) (= (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|))) (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)) (= (select (select |#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|))) (= 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|))), 8401#(and (not (= 0 (select (select |#memory_$Pointer$.base| |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|))) (= 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|)))), 8402#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (and (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|) (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|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))) (not (= (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|) (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|)))), 8403#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (and (= 1 (select |#valid| |main_#t~mem13.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4))) (not (= |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_~#list~0.base|) |main_~#list~0.offset|)))), 8404#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (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))))), 8405#(and (not (= 0 (select (select |#memory_$Pointer$.base| |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|))) (= |main_#t~mem14.offset| 0) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4)))) (= 1 (select |#valid| main_~next~0.base))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8406#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (or (and (= 1 (select (store |#valid| |main_#t~mem15.base| 0) main_~next~0.base)) (not (= main_~next~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8407#(and (not (= 0 (select (select |#memory_$Pointer$.base| |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|))) (= 1 (select |#valid| main_~next~0.base))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8408#(and (or (and (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem16.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))) (not (= 0 |main_#t~mem16.base|))), 8409#(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))), 8410#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 8411#(= 1 (select |#valid| |main_#t~mem18.base|)), 8377#true, 8378#false, 8379#(= (select |#valid| |main_~#list~0.base|) 1), 8380#(= |#valid| |old(#valid)|), 8381#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 8382#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 8383#(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|))] [2018-02-04 02:01:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:37,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-04 02:01:37,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-04 02:01:37,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1101, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 02:01:37,736 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 35 states. [2018-02-04 02:01:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:40,225 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2018-02-04 02:01:40,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 02:01:40,225 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 64 [2018-02-04 02:01:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:40,226 INFO L225 Difference]: With dead ends: 146 [2018-02-04 02:01:40,226 INFO L226 Difference]: Without dead ends: 146 [2018-02-04 02:01:40,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=394, Invalid=4576, Unknown=0, NotChecked=0, Total=4970 [2018-02-04 02:01:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-04 02:01:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2018-02-04 02:01:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 02:01:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-02-04 02:01:40,229 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 64 [2018-02-04 02:01:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:40,229 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-02-04 02:01:40,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-04 02:01:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-02-04 02:01:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 02:01:40,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:40,230 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:40,231 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash -689631825, now seen corresponding path program 1 times [2018-02-04 02:01:40,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:40,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:40,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:40,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 02:01:40,857 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:40,857 INFO L182 omatonBuilderFactory]: Interpolants [8768#(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| |main_~#list~0.base|) 1)), 8769#(and (= |main_#t~mem18.offset| 0) (<= 8 (select |#length| |main_#t~mem18.base|))), 8746#true, 8747#false, 8748#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 8749#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 8750#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 8751#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)), 8752#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 8753#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 8754#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8755#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8756#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)))), 8757#(and (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|))) (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem2.offset|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))), 8758#(and (or (= append_~plist.base append_~item~0.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)))) (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)))), 8759#(and (or (= append_~plist.base append_~item~0.base) (and (or (and (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem4.base| (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))) (not (= |append_#t~mem4.offset| 0))) (or (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem4.offset|) (= |append_#t~mem4.offset| 0)))) (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)))), 8760#(and (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_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.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 (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)))), 8761#(or (and (<= 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|)))) (= (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|)))) (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (and (not (= 0 (select (select |#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|))), 8762#(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 (= 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|)))), 8763#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))))), 8764#(or (and (<= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8765#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset))), 8766#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (not (= 0 |main_#t~mem16.base|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 8767#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))))] [2018-02-04 02:01:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:40,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 02:01:40,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 02:01:40,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-02-04 02:01:40,858 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 24 states. [2018-02-04 02:01:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:41,947 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-02-04 02:01:41,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:01:41,947 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-02-04 02:01:41,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:41,948 INFO L225 Difference]: With dead ends: 152 [2018-02-04 02:01:41,948 INFO L226 Difference]: Without dead ends: 152 [2018-02-04 02:01:41,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=314, Invalid=2236, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 02:01:41,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-04 02:01:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2018-02-04 02:01:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 02:01:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-02-04 02:01:41,950 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 64 [2018-02-04 02:01:41,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:41,950 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-02-04 02:01:41,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 02:01:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-02-04 02:01:41,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 02:01:41,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:41,951 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:41,951 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:41,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1311960533, now seen corresponding path program 1 times [2018-02-04 02:01:41,952 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:41,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:42,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:42,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 02:01:42,371 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:42,372 INFO L182 omatonBuilderFactory]: Interpolants [9098#true, 9099#false, 9100#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 9101#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|)), 9102#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)), 9103#(not (= 0 (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|))), 9104#(not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 9105#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 9106#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|)), 9107#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 |append_#t~malloc0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|)), 9108#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (or (not (= append_~plist.base append_~item~0.base)) (not (= 0 append_~item~0.base)))), 9109#(and (= append_~plist.base |append_#in~plist.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= (select (select |#memory_$Pointer$.base| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem2.base|) (or (not (= append_~plist.base append_~item~0.base)) (not (= 0 append_~item~0.base)))), 9110#(and (= append_~plist.base |append_#in~plist.base|) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= append_~plist.offset |append_#in~plist.offset|) (or (not (= append_~plist.base append_~item~0.base)) (not (= 0 append_~item~0.base)))), 9111#(and (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|))) (or (= append_~plist.base append_~item~0.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))))), 9112#(or (and (not (= 0 (select (select |#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|)) (= (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|)))), 9113#(or (not (= 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|)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9114#(or (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9115#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 |main_#t~mem13.base|))), 9116#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (not (= 0 main_~next~0.base))), 9117#(or (not (= 0 main_~next~0.base)) (and (not (= 0 |main_#t~mem16.base|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9118#(or (not (= 0 main_~next~0.base)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9119#(not (= 0 |main_#t~mem24.base|))] [2018-02-04 02:01:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:42,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:01:42,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:01:42,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:01:42,372 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 22 states. [2018-02-04 02:01:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:42,978 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2018-02-04 02:01:42,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 02:01:42,978 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2018-02-04 02:01:42,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:42,979 INFO L225 Difference]: With dead ends: 141 [2018-02-04 02:01:42,979 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 02:01:42,979 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=1492, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 02:01:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 02:01:42,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 121. [2018-02-04 02:01:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 02:01:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2018-02-04 02:01:42,981 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 66 [2018-02-04 02:01:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:42,981 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2018-02-04 02:01:42,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:01:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-02-04 02:01:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 02:01:42,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:42,981 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:42,981 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:42,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1656676748, now seen corresponding path program 1 times [2018-02-04 02:01:42,982 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:42,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 02:01:43,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:43,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:01:43,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:43,018 INFO L182 omatonBuilderFactory]: Interpolants [9424#false, 9425#(= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 9426#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 9427#(= 1 (select |#valid| |main_#t~mem20.base|)), 9423#true] [2018-02-04 02:01:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 02:01:43,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:01:43,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:01:43,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:01:43,019 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 5 states. [2018-02-04 02:01:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:43,084 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-02-04 02:01:43,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:01:43,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-02-04 02:01:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:43,085 INFO L225 Difference]: With dead ends: 123 [2018-02-04 02:01:43,085 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 02:01:43,085 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-04 02:01:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 02:01:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-02-04 02:01:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 02:01:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-02-04 02:01:43,087 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 68 [2018-02-04 02:01:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:43,087 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-02-04 02:01:43,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:01:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-02-04 02:01:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 02:01:43,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:43,088 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:43,088 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1656676747, now seen corresponding path program 1 times [2018-02-04 02:01:43,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:43,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:43,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:43,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 02:01:43,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:43,731 INFO L182 omatonBuilderFactory]: Interpolants [9675#true, 9676#false, 9677#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 9678#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 9679#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 9680#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)), 9681#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 9682#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 9683#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9684#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9685#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)))), 9686#(and (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|))) (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= (select (select |#memory_$Pointer$.offset| append_~plist.base) |append_#in~plist.offset|) |append_#t~mem2.offset|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))), 9687#(and (or (= append_~plist.base append_~item~0.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)))) (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)))), 9688#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (or (= |append_#t~mem4.base| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (not (= |append_#t~mem4.offset| 0))) (= append_~plist.offset |append_#in~plist.offset|) (or (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem4.offset|) (= |append_#t~mem4.offset| 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)))) (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)))), 9689#(and (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|))) (or (= append_~plist.base append_~item~0.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))))), 9690#(or (and (not (= 0 (select (select |#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|)) (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))))), 9691#(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 (= 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|)))), 9692#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))))), 9693#(or (and (<= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9694#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset))), 9695#(or (and (<= 8 (select |#length| main_~next~0.base)) (= 0 main_~next~0.offset)) (and (not (= 0 |main_#t~mem16.base|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 9696#(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|)))), 9697#(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|))), 9698#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_#t~mem18.offset| 0) (= |main_#t~mem18.offset| (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))), 9699#(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|)))), 9700#(and (<= 0 |main_#t~mem20.offset|) (<= (+ |main_#t~mem20.offset| 8) (select |#length| |main_#t~mem20.base|)))] [2018-02-04 02:01:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:43,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 02:01:43,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 02:01:43,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:01:43,732 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 26 states. [2018-02-04 02:01:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:44,901 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2018-02-04 02:01:44,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 02:01:44,901 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 68 [2018-02-04 02:01:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:44,901 INFO L225 Difference]: With dead ends: 143 [2018-02-04 02:01:44,901 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 02:01:44,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=329, Invalid=2427, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 02:01:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 02:01:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2018-02-04 02:01:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 02:01:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-02-04 02:01:44,904 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 68 [2018-02-04 02:01:44,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:44,904 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-02-04 02:01:44,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 02:01:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-02-04 02:01:44,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 02:01:44,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:44,905 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:44,905 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:44,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1656664800, now seen corresponding path program 1 times [2018-02-04 02:01:44,906 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:44,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:45,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:45,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:01:45,372 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:45,373 INFO L182 omatonBuilderFactory]: Interpolants [10023#true, 10024#false, 10025#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 10026#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 10027#(and (= 0 append_~item~0.offset) (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|)), 10028#(= 0 (select (select |#memory_$Pointer$.offset| |append_#in~plist.base|) |append_#in~plist.offset|)), 10029#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)), 10030#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 10031#(and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10032#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10033#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)))), 10034#(and (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|))) (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| append_~plist.base) append_~plist.offset)) (= append_~plist.offset |append_#in~plist.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))), 10035#(and (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|))) (or (= append_~plist.base append_~item~0.base) (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|) (= append_~plist.offset |append_#in~plist.offset|)))), 10036#(or (and (not (= 0 (select (select |#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|)) (= (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|))), 10037#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 (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|)))), 10038#(or (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10039#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 |main_#t~mem13.offset|)), 10040#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= 0 main_~next~0.offset)), 10041#(or (= 0 main_~next~0.offset) (and (not (= 0 |main_#t~mem16.base|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)))), 10042#(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|)))), 10043#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= (select |#valid| |main_~#list~0.base|) 1)), 10044#(= 0 |main_#t~mem22.offset|)] [2018-02-04 02:01:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:45,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 02:01:45,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 02:01:45,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-04 02:01:45,373 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 22 states. [2018-02-04 02:01:46,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:46,152 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-02-04 02:01:46,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:01:46,152 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-02-04 02:01:46,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:46,153 INFO L225 Difference]: With dead ends: 137 [2018-02-04 02:01:46,153 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 02:01:46,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=330, Invalid=2120, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 02:01:46,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 02:01:46,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2018-02-04 02:01:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 02:01:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-02-04 02:01:46,155 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 68 [2018-02-04 02:01:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:46,155 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-02-04 02:01:46,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 02:01:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-02-04 02:01:46,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 02:01:46,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:46,156 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:46,156 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:46,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1656664799, now seen corresponding path program 1 times [2018-02-04 02:01:46,156 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:46,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 02:01:46,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:01:46,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:01:46,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:46,186 INFO L182 omatonBuilderFactory]: Interpolants [10368#true, 10369#false, 10370#(= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)), 10371#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 10372#(= 1 (select |#valid| |main_#t~mem22.base|))] [2018-02-04 02:01:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 02:01:46,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:01:46,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:01:46,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:01:46,186 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 5 states. [2018-02-04 02:01:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:46,265 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2018-02-04 02:01:46,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:01:46,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-02-04 02:01:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:46,267 INFO L225 Difference]: With dead ends: 132 [2018-02-04 02:01:46,267 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 02:01:46,267 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-04 02:01:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 02:01:46,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-02-04 02:01:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-04 02:01:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-02-04 02:01:46,270 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 68 [2018-02-04 02:01:46,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:46,271 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-02-04 02:01:46,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:01:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-02-04 02:01:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 02:01:46,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:46,271 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:46,272 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:46,272 INFO L82 PathProgramCache]: Analyzing trace with hash 182628422, now seen corresponding path program 1 times [2018-02-04 02:01:46,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:01:46,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:01:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:47,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:01:47,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-04 02:01:47,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:01:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:47,496 INFO L182 omatonBuilderFactory]: Interpolants [10640#true, 10641#false, 10642#(= (select |#valid| |main_~#list~0.base|) 1), 10643#(= |#valid| |old(#valid)|), 10644#(and (= append_~plist.base |append_#in~plist.base|) (= |#valid| |old(#valid)|) (= append_~plist.offset |append_#in~plist.offset|)), 10645#(and (= append_~plist.base |append_#in~plist.base|) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|)), 10646#(and (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|))) (or (and (= 0 append_~item~0.offset) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base)) (= append_~plist.base append_~item~0.base))), 10647#(and (or (= append_~plist.base append_~item~0.base) (and (= 0 append_~item~0.offset) (= (select |#valid| append_~item~0.base) 1) (= append_~plist.offset |append_#in~plist.offset|) (= |append_#in~plist.base| append_~plist.base))) (or (not (= append_~plist.base append_~item~0.base)) (= 0 (select |old(#valid)| |append_#in~plist.base|)))), 10648#(or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |append_#in~plist.base|) |append_#in~plist.offset|)) 1) (not (= |append_#in~plist.base| (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|))) (= 0 (select |old(#valid)| |append_#in~plist.base|))), 10649#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 1)), 10650#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10651#(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)|)), 10652#(and (= append_~plist.base |append_#in~plist.base|) (not (= 0 |append_#t~malloc0.base|)) (= 0 (select |old(#valid)| |append_#t~malloc0.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= append_~plist.offset |append_#in~plist.offset|) (= 0 |append_#t~malloc0.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10653#(and (or (= append_~plist.base append_~item~0.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)|))) (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)))), 10654#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= |append_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| 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)|) (= |append_#t~mem2.base| (select (select |#memory_$Pointer$.base| append_~plist.base) append_~plist.offset)))) (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)))), 10655#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.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_~plist.offset |append_#in~plist.offset|) (= 0 (select |old(#valid)| append_~item~0.base)) (= (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 (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)))), 10656#(and (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|))) (or (= append_~plist.base append_~item~0.base) (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|)) (or (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_#t~mem4.base| append_~item~0.base))) (= append_~plist.base |append_#in~plist.base|) (or (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem4.offset|) (= 0 |append_#t~mem4.offset|)) (or (and (= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#t~mem4.base|) (or (= |append_#t~mem4.base| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (= |append_#t~mem4.base| append_~plist.base))) (= |append_#t~mem4.base| append_~item~0.base)) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)))), 10657#(and (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|))) (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.base|) (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|)) (not (= 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|) (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| append_~item~0.base) append_~item~0.offset)) 4) |append_#t~mem5.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))))) (= append_~plist.offset |append_#in~plist.offset|)))), 10658#(and (or (= append_~plist.base append_~item~0.base) (and (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (or (and (= (select (store (select |#memory_$Pointer$.offset| append_~item~0.base) (+ append_~item~0.offset 4) |append_#t~ite7.offset|) append_~item~0.offset) (select (select |old(#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)) (= (select (select (store |#memory_$Pointer$.offset| append_~item~0.base (store (select |#memory_$Pointer$.offset| append_~item~0.base) (+ append_~item~0.offset 4) |append_#t~ite7.offset|)) (select (store (select |#memory_$Pointer$.base| append_~item~0.base) (+ append_~item~0.offset 4) |append_#t~ite7.base|) append_~item~0.offset)) 4) |append_#t~ite7.offset|)) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) (select (store (select |#memory_$Pointer$.base| append_~item~0.base) (+ append_~item~0.offset 4) |append_#t~ite7.base|) append_~item~0.offset))) (= (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|) |append_#in~plist.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))))) (= append_~plist.offset |append_#in~plist.offset|))) (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|)))), 10659#(and (or (not (= append_~plist.base append_~item~0.base)) (and (= append_~item~0.base |append_#in~plist.base|) (not (= 0 append_~item~0.base)) (= append_~plist.offset |append_#in~plist.offset|))) (or (= append_~plist.base append_~item~0.base) (and (or (and (= (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|)) (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 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)) (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$.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)))) (= (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))) (= 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|)) (= append_~plist.base |append_#in~plist.base|) (= append_~item~0.offset 0) (= append_~plist.offset |append_#in~plist.offset|)))), 10660#(or (and (not (= 0 (select (select |#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|)) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |append_#in~plist.base|) |append_#in~plist.offset|))) (and (or (not (= (select (select |old(#memory_$Pointer$.offset)| |append_#in~plist.base|) |append_#in~plist.offset|) 0)) (= (select (select |#memory_$Pointer$.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|))) 4) (select (select |#memory_$Pointer$.offset| (select (select |#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|)) (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|)) (= 0 (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| (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|) |append_#in~plist.base|)), 10661#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 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|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|))) 4) (select (select |#memory_$Pointer$.offset| (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|)) (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)))))), 10662#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem12.base|) |main_#t~mem12.offset|)) (not (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem12.base|) |main_#t~mem12.offset|)) 4) (select (select |#memory_$Pointer$.offset| (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|)))), 10663#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (not (= |main_~#list~0.base| |main_#t~mem13.base|)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) 4) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)) (= 0 |main_#t~mem13.offset|))), 10664#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 main_~next~0.offset) (= (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 4) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) 4)))), 10665#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 main_~next~0.offset) (= 0 |main_#t~mem14.offset|) (= (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 4) (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) (+ |main_#t~mem14.offset| 4))))), 10666#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 4) |main_#t~mem15.offset|) (= 0 main_~next~0.offset))), 10667#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 4)) (= 0 main_~next~0.offset))), 10668#(or (and (not (= 0 |main_#t~mem16.base|)) (= |main_~#list~0.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|)) (= |main_#t~mem16.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 4)) (= 0 main_~next~0.offset))), 10669#(or (and (= 0 (select (select (store |#memory_$Pointer$.offset| |main_~#list~0.base| (store (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset| main_~next~0.offset)) main_~next~0.base) 4)) (= 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|)))), 10670#(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))), 10671#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) |main_~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 4)) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) |main_~#list~0.offset|))), 10672#(and (= 0 |main_#t~mem20.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4)))), 10673#(= 0 |main_#t~mem21.offset|)] [2018-02-04 02:01:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:01:47,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 02:01:47,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 02:01:47,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1047, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:01:47,497 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 34 states. [2018-02-04 02:01:48,460 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 100 DAG size of output 87 [2018-02-04 02:01:48,631 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 118 DAG size of output 100 [2018-02-04 02:01:48,852 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 141 DAG size of output 118 [2018-02-04 02:01:49,008 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 92 DAG size of output 85 [2018-02-04 02:01:49,208 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 109 DAG size of output 102 [2018-02-04 02:01:50,289 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 107 DAG size of output 89 [2018-02-04 02:01:50,493 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 130 DAG size of output 108 [2018-02-04 02:01:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:01:51,197 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2018-02-04 02:01:51,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 02:01:51,198 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 69 [2018-02-04 02:01:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:01:51,198 INFO L225 Difference]: With dead ends: 192 [2018-02-04 02:01:51,198 INFO L226 Difference]: Without dead ends: 192 [2018-02-04 02:01:51,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=458, Invalid=4944, Unknown=0, NotChecked=0, Total=5402 [2018-02-04 02:01:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-04 02:01:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 136. [2018-02-04 02:01:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-04 02:01:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2018-02-04 02:01:51,201 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 69 [2018-02-04 02:01:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:01:51,202 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2018-02-04 02:01:51,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 02:01:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2018-02-04 02:01:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 02:01:51,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:01:51,202 INFO L351 BasicCegarLoop]: trace histogram [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-04 02:01:51,202 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 02:01:51,202 INFO L82 PathProgramCache]: Analyzing trace with hash 182628423, now seen corresponding path program 1 times [2018-02-04 02:01:51,203 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:01:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:01:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:01:51,255 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 02:01:51,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:01:51 BoogieIcfgContainer [2018-02-04 02:01:51,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:01:51,292 INFO L168 Benchmark]: Toolchain (without parser) took 37813.09 ms. Allocated memory was 392.2 MB in the beginning and 1.3 GB in the end (delta: 903.3 MB). Free memory was 346.2 MB in the beginning and 614.9 MB in the end (delta: -268.6 MB). Peak memory consumption was 634.7 MB. Max. memory is 5.3 GB. [2018-02-04 02:01:51,293 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 392.2 MB. Free memory is still 352.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:01:51,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.55 ms. Allocated memory is still 392.2 MB. Free memory was 346.2 MB in the beginning and 335.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:01:51,293 INFO L168 Benchmark]: Boogie Preprocessor took 27.13 ms. Allocated memory is still 392.2 MB. Free memory was 335.6 MB in the beginning and 334.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 02:01:51,294 INFO L168 Benchmark]: RCFGBuilder took 339.05 ms. Allocated memory is still 392.2 MB. Free memory was 334.3 MB in the beginning and 301.2 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-04 02:01:51,294 INFO L168 Benchmark]: TraceAbstraction took 37290.36 ms. Allocated memory was 392.2 MB in the beginning and 1.3 GB in the end (delta: 903.3 MB). Free memory was 301.2 MB in the beginning and 614.9 MB in the end (delta: -313.6 MB). Peak memory consumption was 589.7 MB. Max. memory is 5.3 GB. [2018-02-04 02:01:51,295 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.16 ms. Allocated memory is still 392.2 MB. Free memory is still 352.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.55 ms. Allocated memory is still 392.2 MB. Free memory was 346.2 MB in the beginning and 335.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.13 ms. Allocated memory is still 392.2 MB. Free memory was 335.6 MB in the beginning and 334.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 339.05 ms. Allocated memory is still 392.2 MB. Free memory was 334.3 MB in the beginning and 301.2 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 37290.36 ms. Allocated memory was 392.2 MB in the beginning and 1.3 GB in the end (delta: 903.3 MB). Free memory was 301.2 MB in the beginning and 614.9 MB in the end (delta: -313.6 MB). Peak memory consumption was 589.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L635] FCALL struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] EXPR, FCALL malloc(sizeof *item) VAL [malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={14:0}, malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L627] EXPR, FCALL \read(**plist) VAL [\read(**plist)={0:0}, item={14:0}, malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L627] FCALL item->next = *plist VAL [\read(**plist)={0:0}, item={14:0}, malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L628] EXPR, FCALL item->next VAL [item={14:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [item={14:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L630] EXPR, FCALL malloc(sizeof *item) VAL [item={14:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={14:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={14:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L631] RET, FCALL *plist = item VAL [item={14:0}, malloc(sizeof *item)={11:0}, malloc(sizeof *item)={14:0}, plist={10:0}, plist={10:0}] [L637] append(&list) VAL [list={10:0}] [L638] COND TRUE __VERIFIER_nondet_int() [L637] CALL append(&list) VAL [plist={10:0}] [L626] EXPR, FCALL malloc(sizeof *item) VAL [malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L627] EXPR, FCALL \read(**plist) VAL [\read(**plist)={14:0}, item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L627] FCALL item->next = *plist VAL [\read(**plist)={14:0}, item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628] EXPR, FCALL item->next VAL [item={13:0}, item->next={14:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628-L630] COND TRUE, EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [item={13:0}, item->next={14:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L629] EXPR, FCALL item->next VAL [item={13:0}, item->next={14:0}, item->next={14:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L629] EXPR, FCALL item->next->data VAL [item={13:0}, item->next={14:0}, item->next={14:0}, item->next->data={11:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={13:0}, item->next={14:0}, item->next={14:0}, item->next->data={11:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={11:0}, item={13:0}, item->next={14:0}, item->next={14:0}, item->next->data={11:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L631] RET, FCALL *plist = item VAL [item={13:0}, malloc(sizeof *item)={13:0}, plist={10:0}, plist={10:0}] [L637] append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] FCALL \read(*list) VAL [\read(*list)={13:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR, FCALL \read(*list) VAL [\read(*list)={13:0}, list={10:0}] [L640] EXPR, FCALL list->next VAL [\read(*list)={13:0}, list={10:0}, list->next={14:0}] [L640] struct item *next = list->next; [L641] EXPR, FCALL \read(*list) VAL [\read(*list)={13:0}, list={10:0}, next={14:0}] [L641] EXPR, FCALL list->data VAL [\read(*list)={13:0}, list={10:0}, list->data={11:0}, next={14:0}] [L641] FCALL free(list->data) VAL [\read(*list)={13:0}, list={10:0}, list->data={11:0}, next={14:0}] [L642] EXPR, FCALL \read(*list) VAL [\read(*list)={13:0}, list={10:0}, next={14:0}] [L642] FCALL free(list) VAL [\read(*list)={13:0}, list={10:0}, next={14:0}] [L643] FCALL list = next VAL [list={10:0}, next={14:0}] [L645] FCALL \read(*list) VAL [\read(*list)={14:0}, list={10:0}, next={14:0}] [L645] COND TRUE \read(*list) [L646] EXPR, FCALL \read(*list) VAL [\read(*list)={14:0}, list={10:0}, next={14:0}] [L646] EXPR, FCALL list->next VAL [\read(*list)={14:0}, list={10:0}, list->next={0:0}, next={14:0}] [L646] struct item *next = list->next; [L647] COND TRUE !next VAL [list={10:0}, next={0:0}, next={14:0}] [L648] EXPR, FCALL \read(*list) VAL [\read(*list)={14:0}, list={10:0}, next={0:0}, next={14:0}] [L648] EXPR, FCALL list->data VAL [\read(*list)={14:0}, list={10:0}, list->data={11:0}, next={14:0}, next={0:0}] [L648] FCALL free(list->data) VAL [\read(*list)={14:0}, list={10:0}, list->data={11:0}, next={0:0}, next={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 117 locations, 53 error locations. UNSAFE Result, 37.2s OverallTime, 40 OverallIterations, 2 TraceHistogramMax, 24.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2402 SDtfs, 4120 SDslu, 12147 SDs, 0 SdLazy, 16759 SolverSat, 884 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1037 GetRequests, 66 SyntacticMatches, 16 SemanticMatches, 955 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9183 ImplicationChecksByTransitivity, 25.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 125/266 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 437 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 1660 NumberOfCodeBlocks, 1660 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1552 ConstructedInterpolants, 0 QuantifiedInterpolants, 1401160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 24 PerfectInterpolantSequences, 125/266 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-01-51-301.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-01-51-301.csv Received shutdown request...