java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:28:22,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:28:22,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:28:22,196 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:28:22,196 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:28:22,197 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:28:22,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:28:22,200 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:28:22,201 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:28:22,202 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:28:22,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:28:22,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:28:22,204 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:28:22,205 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:28:22,205 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:28:22,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:28:22,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:28:22,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:28:22,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:28:22,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:28:22,213 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:28:22,214 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:28:22,214 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:28:22,215 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:28:22,215 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:28:22,216 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:28:22,216 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:28:22,217 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:28:22,217 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:28:22,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:28:22,218 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:28:22,218 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:28:22,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:28:22,228 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:28:22,229 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:28:22,230 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:28:22,230 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:28:22,230 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:28:22,230 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:28:22,230 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:28:22,230 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:28:22,231 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:28:22,231 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:28:22,231 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:28:22,231 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:28:22,231 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:28:22,231 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:28:22,232 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:28:22,232 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:28:22,232 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:28:22,232 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:28:22,232 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:28:22,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:28:22,233 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:28:22,233 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:28:22,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:28:22,271 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:28:22,274 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:28:22,275 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:28:22,276 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:28:22,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:28:22,427 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:28:22,428 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:28:22,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:28:22,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:28:22,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:28:22,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:28:22" (1/1) ... [2018-02-02 10:28:22,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274f1477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:28:22, skipping insertion in model container [2018-02-02 10:28:22,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:28:22" (1/1) ... [2018-02-02 10:28:22,446 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:28:22,475 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:28:22,571 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:28:22,590 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:28:22,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:28:22 WrapperNode [2018-02-02 10:28:22,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:28:22,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:28:22,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:28:22,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:28:22,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:28:22" (1/1) ... [2018-02-02 10:28:22,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:28:22" (1/1) ... [2018-02-02 10:28:22,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:28:22" (1/1) ... [2018-02-02 10:28:22,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:28:22" (1/1) ... [2018-02-02 10:28:22,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:28:22" (1/1) ... [2018-02-02 10:28:22,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:28:22" (1/1) ... [2018-02-02 10:28:22,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:28:22" (1/1) ... [2018-02-02 10:28:22,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:28:22,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:28:22,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:28:22,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:28:22,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:28:22" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:28:22,672 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:28:22,672 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:28:22,672 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:28:22,672 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:28:22,672 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:28:22,673 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:28:22,673 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:28:22,673 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:28:22,673 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:28:22,673 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:28:22,673 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:28:22,673 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:28:22,673 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:28:22,673 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:28:22,673 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:28:22,673 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:28:22,673 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:28:23,086 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:28:23,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:28:23 BoogieIcfgContainer [2018-02-02 10:28:23,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:28:23,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:28:23,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:28:23,089 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:28:23,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:28:22" (1/3) ... [2018-02-02 10:28:23,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d773cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:28:23, skipping insertion in model container [2018-02-02 10:28:23,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:28:22" (2/3) ... [2018-02-02 10:28:23,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d773cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:28:23, skipping insertion in model container [2018-02-02 10:28:23,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:28:23" (3/3) ... [2018-02-02 10:28:23,092 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-02-02 10:28:23,097 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:28:23,102 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 69 error locations. [2018-02-02 10:28:23,125 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:28:23,125 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:28:23,125 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:28:23,125 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:28:23,125 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:28:23,125 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:28:23,125 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:28:23,125 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:28:23,126 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:28:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states. [2018-02-02 10:28:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:28:23,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:23,146 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:23,146 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:23,149 INFO L82 PathProgramCache]: Analyzing trace with hash 115964591, now seen corresponding path program 1 times [2018-02-02 10:28:23,187 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:23,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:23,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:23,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:28:23,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:23,264 INFO L182 omatonBuilderFactory]: Interpolants [166#true, 167#false, 168#(= 1 (select |#valid| |main_#t~malloc0.base|)), 169#(= 1 (select |#valid| main_~null~0.base))] [2018-02-02 10:28:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:23,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:28:23,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:28:23,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:28:23,276 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 4 states. [2018-02-02 10:28:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:23,538 INFO L93 Difference]: Finished difference Result 182 states and 189 transitions. [2018-02-02 10:28:23,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:28:23,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:28:23,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:23,550 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:28:23,550 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 10:28:23,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 10:28:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 160. [2018-02-02 10:28:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:28:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-02-02 10:28:23,580 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 8 [2018-02-02 10:28:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:23,580 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-02-02 10:28:23,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:28:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-02-02 10:28:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 10:28:23,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:23,581 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:23,581 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:23,581 INFO L82 PathProgramCache]: Analyzing trace with hash 115964592, now seen corresponding path program 1 times [2018-02-02 10:28:23,582 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:23,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:23,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:23,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:28:23,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:23,645 INFO L182 omatonBuilderFactory]: Interpolants [514#true, 515#false, 516#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 517#(and (= (select |#length| main_~null~0.base) 12) (= main_~null~0.offset 0))] [2018-02-02 10:28:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:23,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:28:23,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:28:23,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:28:23,648 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 4 states. [2018-02-02 10:28:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:23,752 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2018-02-02 10:28:23,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:28:23,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 10:28:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:23,754 INFO L225 Difference]: With dead ends: 156 [2018-02-02 10:28:23,755 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:28:23,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:28:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-02 10:28:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:28:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2018-02-02 10:28:23,763 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 8 [2018-02-02 10:28:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:23,764 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2018-02-02 10:28:23,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:28:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2018-02-02 10:28:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:28:23,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:23,765 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:23,765 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash 992494940, now seen corresponding path program 1 times [2018-02-02 10:28:23,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:23,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:23,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:23,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:23,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:28:23,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:23,807 INFO L182 omatonBuilderFactory]: Interpolants [832#true, 833#false, 834#(= 1 (select |#valid| |main_#t~malloc4.base|)), 835#(= 1 (select |#valid| main_~list~0.base))] [2018-02-02 10:28:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:23,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:28:23,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:28:23,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:28:23,807 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 4 states. [2018-02-02 10:28:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:23,923 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2018-02-02 10:28:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:28:23,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 10:28:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:23,924 INFO L225 Difference]: With dead ends: 162 [2018-02-02 10:28:23,925 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:28:23,925 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:28:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 150. [2018-02-02 10:28:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:28:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-02-02 10:28:23,931 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 13 [2018-02-02 10:28:23,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:23,932 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-02-02 10:28:23,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:28:23,932 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-02-02 10:28:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:28:23,932 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:23,933 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:23,933 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:23,933 INFO L82 PathProgramCache]: Analyzing trace with hash 992494941, now seen corresponding path program 1 times [2018-02-02 10:28:23,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:23,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:23,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:23,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:28:23,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:23,991 INFO L182 omatonBuilderFactory]: Interpolants [1152#(and (= 12 (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1153#(and (= main_~list~0.offset 0) (= (select |#length| main_~list~0.base) 12)), 1150#true, 1151#false] [2018-02-02 10:28:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:23,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:28:23,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:28:23,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:28:23,992 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 4 states. [2018-02-02 10:28:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:24,079 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-02-02 10:28:24,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:28:24,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 10:28:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:24,081 INFO L225 Difference]: With dead ends: 162 [2018-02-02 10:28:24,081 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:28:24,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:28:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2018-02-02 10:28:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 10:28:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2018-02-02 10:28:24,091 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 13 [2018-02-02 10:28:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:24,091 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2018-02-02 10:28:24,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:28:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2018-02-02 10:28:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:28:24,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:24,092 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:24,092 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:24,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1268132201, now seen corresponding path program 1 times [2018-02-02 10:28:24,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:24,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:24,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:24,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:28:24,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:24,163 INFO L182 omatonBuilderFactory]: Interpolants [1472#true, 1473#false, 1474#(= (select |#valid| main_~list~0.base) 1), 1475#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:28:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:24,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:28:24,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:28:24,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:28:24,164 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 4 states. [2018-02-02 10:28:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:24,288 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-02-02 10:28:24,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:28:24,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-02 10:28:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:24,289 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:28:24,290 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:28:24,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:28:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2018-02-02 10:28:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:28:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-02-02 10:28:24,298 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 21 [2018-02-02 10:28:24,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:24,298 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-02-02 10:28:24,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:28:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-02-02 10:28:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:28:24,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:24,299 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:24,299 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:24,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1268132202, now seen corresponding path program 1 times [2018-02-02 10:28:24,300 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:24,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:24,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:24,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:28:24,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:24,387 INFO L182 omatonBuilderFactory]: Interpolants [1776#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= 12 (select |#length| main_~list~0.base))), 1777#(and (= main_~end~0.offset 0) (= (select |#valid| main_~end~0.base) 1) (= 12 (select |#length| main_~end~0.base))), 1778#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12)), 1772#true, 1773#false, 1774#(and (= 12 (select |#length| |main_#t~malloc4.base|)) (= 0 |main_#t~malloc4.offset|)), 1775#(and (= 0 main_~list~0.offset) (= 12 (select |#length| main_~list~0.base)))] [2018-02-02 10:28:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:24,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:28:24,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:28:24,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:28:24,387 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 7 states. [2018-02-02 10:28:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:24,611 INFO L93 Difference]: Finished difference Result 179 states and 189 transitions. [2018-02-02 10:28:24,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:28:24,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-02 10:28:24,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:24,612 INFO L225 Difference]: With dead ends: 179 [2018-02-02 10:28:24,612 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 10:28:24,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:28:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 10:28:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 153. [2018-02-02 10:28:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 10:28:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2018-02-02 10:28:24,617 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 21 [2018-02-02 10:28:24,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:24,617 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2018-02-02 10:28:24,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:28:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2018-02-02 10:28:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:28:24,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:24,618 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:24,618 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:24,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1095666644, now seen corresponding path program 1 times [2018-02-02 10:28:24,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:24,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:24,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:24,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:28:24,659 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:24,659 INFO L182 omatonBuilderFactory]: Interpolants [2119#true, 2120#false, 2121#(= 1 (select |#valid| |main_#t~malloc9.base|)), 2122#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 2123#(= 1 (select |#valid| |main_#t~mem11.base|))] [2018-02-02 10:28:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:24,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:28:24,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:28:24,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:24,660 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 5 states. [2018-02-02 10:28:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:24,788 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-02-02 10:28:24,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:28:24,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:28:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:24,789 INFO L225 Difference]: With dead ends: 198 [2018-02-02 10:28:24,789 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 10:28:24,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:28:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 10:28:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 152. [2018-02-02 10:28:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:28:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-02-02 10:28:24,792 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 23 [2018-02-02 10:28:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:24,792 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-02-02 10:28:24,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:28:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-02-02 10:28:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:28:24,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:24,793 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:24,793 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:24,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1095666643, now seen corresponding path program 1 times [2018-02-02 10:28:24,795 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:24,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:24,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:24,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:28:24,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:24,879 INFO L182 omatonBuilderFactory]: Interpolants [2480#(and (= 0 |main_#t~malloc9.offset|) (= 12 (select |#length| |main_#t~malloc9.base|))), 2481#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 2482#(and (= |main_#t~mem11.offset| 0) (= (select |#length| |main_#t~mem11.base|) 12)), 2478#true, 2479#false] [2018-02-02 10:28:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:24,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:28:24,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:28:24,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:24,880 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 5 states. [2018-02-02 10:28:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:25,025 INFO L93 Difference]: Finished difference Result 225 states and 242 transitions. [2018-02-02 10:28:25,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:28:25,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:28:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:25,026 INFO L225 Difference]: With dead ends: 225 [2018-02-02 10:28:25,027 INFO L226 Difference]: Without dead ends: 225 [2018-02-02 10:28:25,027 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:28:25,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-02 10:28:25,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 151. [2018-02-02 10:28:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:28:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-02-02 10:28:25,029 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 23 [2018-02-02 10:28:25,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:25,029 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-02-02 10:28:25,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:28:25,029 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-02-02 10:28:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:28:25,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:25,030 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:25,030 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:25,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1665799662, now seen corresponding path program 1 times [2018-02-02 10:28:25,031 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:25,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:25,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:25,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:28:25,101 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:25,102 INFO L182 omatonBuilderFactory]: Interpolants [2865#true, 2866#false, 2867#(= (select |#valid| main_~list~0.base) 1), 2868#(= (select |#valid| main_~end~0.base) 1), 2869#(and (= 1 (select |#valid| |main_#t~malloc9.base|)) (not (= main_~end~0.base |main_#t~malloc9.base|))), 2870#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 2871#(and (not (= main_~end~0.base |main_#t~mem11.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 2872#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 2873#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-02-02 10:28:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:25,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:28:25,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:28:25,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:28:25,102 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 9 states. [2018-02-02 10:28:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:25,412 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2018-02-02 10:28:25,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:28:25,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-02 10:28:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:25,414 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:28:25,414 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:28:25,415 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:28:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:28:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 150. [2018-02-02 10:28:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:28:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-02-02 10:28:25,418 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 27 [2018-02-02 10:28:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:25,419 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-02-02 10:28:25,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:28:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-02-02 10:28:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:28:25,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:25,420 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-02 10:28:25,420 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1665799663, now seen corresponding path program 1 times [2018-02-02 10:28:25,421 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:25,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:25,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-02 10:28:25,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:25,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:28:25,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:25,552 INFO L182 omatonBuilderFactory]: Interpolants [3200#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 3201#(and (= 12 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|)), 3202#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12)), 3193#true, 3194#false, 3195#(= (select |#valid| main_~list~0.base) 1), 3196#(= (select |#valid| main_~end~0.base) 1), 3197#(and (= 0 |main_#t~malloc9.offset|) (= 12 (select |#length| |main_#t~malloc9.base|)) (not (= main_~end~0.base |main_#t~malloc9.base|))), 3198#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 3199#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem11.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset)))] [2018-02-02 10:28:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:25,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:28:25,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:28:25,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:28:25,553 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 10 states. [2018-02-02 10:28:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:26,027 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2018-02-02 10:28:26,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:28:26,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-02 10:28:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:26,028 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:28:26,029 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:28:26,029 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:28:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:28:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 155. [2018-02-02 10:28:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 10:28:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-02-02 10:28:26,033 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 27 [2018-02-02 10:28:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:26,033 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-02-02 10:28:26,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:28:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-02-02 10:28:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:28:26,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:26,034 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:26,034 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:26,034 INFO L82 PathProgramCache]: Analyzing trace with hash 37442029, now seen corresponding path program 1 times [2018-02-02 10:28:26,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:26,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:26,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:26,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:28:26,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:26,092 INFO L182 omatonBuilderFactory]: Interpolants [3555#true, 3556#false, 3557#(= 1 (select |#valid| |main_#t~malloc18.base|)), 3558#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 3559#(= 1 (select |#valid| |main_#t~mem20.base|))] [2018-02-02 10:28:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:26,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:28:26,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:28:26,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:26,093 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 5 states. [2018-02-02 10:28:26,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:26,285 INFO L93 Difference]: Finished difference Result 227 states and 245 transitions. [2018-02-02 10:28:26,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:28:26,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:28:26,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:26,287 INFO L225 Difference]: With dead ends: 227 [2018-02-02 10:28:26,287 INFO L226 Difference]: Without dead ends: 227 [2018-02-02 10:28:26,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:28:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-02 10:28:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 154. [2018-02-02 10:28:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 10:28:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-02-02 10:28:26,291 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 34 [2018-02-02 10:28:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:26,292 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-02-02 10:28:26,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:28:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-02-02 10:28:26,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:28:26,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:26,293 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:26,293 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:26,293 INFO L82 PathProgramCache]: Analyzing trace with hash 37442030, now seen corresponding path program 1 times [2018-02-02 10:28:26,294 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:26,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:26,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:26,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:26,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:28:26,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:26,370 INFO L182 omatonBuilderFactory]: Interpolants [3945#true, 3946#false, 3947#(and (= 12 (select |#length| |main_#t~malloc18.base|)) (= 0 |main_#t~malloc18.offset|)), 3948#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 3949#(and (= (select |#length| |main_#t~mem20.base|) 12) (= |main_#t~mem20.offset| 0))] [2018-02-02 10:28:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:26,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:28:26,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:28:26,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:26,371 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 5 states. [2018-02-02 10:28:26,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:26,576 INFO L93 Difference]: Finished difference Result 254 states and 273 transitions. [2018-02-02 10:28:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:28:26,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:28:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:26,577 INFO L225 Difference]: With dead ends: 254 [2018-02-02 10:28:26,577 INFO L226 Difference]: Without dead ends: 254 [2018-02-02 10:28:26,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:28:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-02-02 10:28:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 153. [2018-02-02 10:28:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 10:28:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-02-02 10:28:26,581 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 34 [2018-02-02 10:28:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:26,581 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-02-02 10:28:26,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:28:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-02-02 10:28:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:28:26,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:26,584 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:26,584 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:26,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1696437201, now seen corresponding path program 1 times [2018-02-02 10:28:26,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:26,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:26,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:26,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:28:26,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:26,644 INFO L182 omatonBuilderFactory]: Interpolants [4368#(= main_~null~0.offset main_~list~0.offset), 4369#(= main_~null~0.offset main_~end~0.offset), 4370#(not (= main_~end~0.base main_~null~0.base)), 4363#true, 4364#false, 4365#(= 0 |main_#t~malloc0.offset|), 4366#(= main_~null~0.offset 0), 4367#(= main_~null~0.offset |main_#t~malloc4.offset|)] [2018-02-02 10:28:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:26,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:28:26,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:28:26,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:28:26,645 INFO L87 Difference]: Start difference. First operand 153 states and 163 transitions. Second operand 8 states. [2018-02-02 10:28:26,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:26,797 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-02-02 10:28:26,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:28:26,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-02-02 10:28:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:26,798 INFO L225 Difference]: With dead ends: 183 [2018-02-02 10:28:26,798 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:28:26,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:28:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:28:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 153. [2018-02-02 10:28:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 10:28:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-02-02 10:28:26,801 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 34 [2018-02-02 10:28:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:26,801 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-02-02 10:28:26,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:28:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-02-02 10:28:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:28:26,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:26,802 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:26,802 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:26,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1185742895, now seen corresponding path program 1 times [2018-02-02 10:28:26,803 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:26,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:26,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:26,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:28:26,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:26,871 INFO L182 omatonBuilderFactory]: Interpolants [4720#false, 4721#(and (= main_~null~0.offset (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) main_~null~0.offset) main_~list~0.offset)) (= main_~null~0.base (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) main_~null~0.base) main_~list~0.offset))), 4722#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4723#(and (= main_~null~0.offset |main_#t~mem31.offset|) (= main_~null~0.base |main_#t~mem31.base|)), 4724#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)), 4719#true] [2018-02-02 10:28:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:26,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:28:26,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:28:26,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:28:26,872 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 6 states. [2018-02-02 10:28:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:27,056 INFO L93 Difference]: Finished difference Result 219 states and 232 transitions. [2018-02-02 10:28:27,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:28:27,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:28:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:27,057 INFO L225 Difference]: With dead ends: 219 [2018-02-02 10:28:27,057 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 10:28:27,057 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:28:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 10:28:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 172. [2018-02-02 10:28:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 10:28:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 183 transitions. [2018-02-02 10:28:27,061 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 183 transitions. Word has length 36 [2018-02-02 10:28:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:27,061 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 183 transitions. [2018-02-02 10:28:27,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:28:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2018-02-02 10:28:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:28:27,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:27,062 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:27,076 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:27,076 INFO L82 PathProgramCache]: Analyzing trace with hash -280280401, now seen corresponding path program 1 times [2018-02-02 10:28:27,078 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:27,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:27,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:27,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:28:27,193 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:27,193 INFO L182 omatonBuilderFactory]: Interpolants [5124#true, 5125#false, 5126#(= (select |#valid| main_~list~0.base) 1), 5127#(= (select |#valid| main_~end~0.base) 1), 5128#(not (= main_~end~0.base |main_#t~malloc9.base|)), 5129#(not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5130#(and (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5131#(and (= 1 (select |#valid| |main_#t~malloc18.base|)) (not (= main_~end~0.base |main_#t~malloc18.base|))), 5132#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 5133#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem20.base|))), 5134#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5135#(= 1 (select |#valid| |main_#t~mem22.base|))] [2018-02-02 10:28:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:27,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:28:27,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:28:27,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:28:27,194 INFO L87 Difference]: Start difference. First operand 172 states and 183 transitions. Second operand 12 states. [2018-02-02 10:28:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:27,508 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2018-02-02 10:28:27,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:28:27,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-02-02 10:28:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:27,509 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:28:27,509 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:28:27,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:28:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:28:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-02-02 10:28:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 10:28:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2018-02-02 10:28:27,512 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 38 [2018-02-02 10:28:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:27,512 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2018-02-02 10:28:27,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:28:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2018-02-02 10:28:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:28:27,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:27,513 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:27,513 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:27,513 INFO L82 PathProgramCache]: Analyzing trace with hash -280280400, now seen corresponding path program 1 times [2018-02-02 10:28:27,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:27,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:27,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:27,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:28:27,667 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:27,668 INFO L182 omatonBuilderFactory]: Interpolants [5504#(not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5505#(and (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5506#(and (= 12 (select |#length| |main_#t~malloc18.base|)) (= 0 |main_#t~malloc18.offset|) (not (= main_~end~0.base |main_#t~malloc18.base|))), 5507#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5508#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem20.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset))), 5509#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5510#(and (= 12 (select |#length| |main_#t~mem22.base|)) (= 0 |main_#t~mem22.offset|)), 5511#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12)), 5499#true, 5500#false, 5501#(= (select |#valid| main_~list~0.base) 1), 5502#(= (select |#valid| main_~end~0.base) 1), 5503#(not (= main_~end~0.base |main_#t~malloc9.base|))] [2018-02-02 10:28:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:27,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:28:27,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:28:27,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:28:27,668 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand 13 states. [2018-02-02 10:28:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:28,070 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2018-02-02 10:28:28,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:28:28,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-02-02 10:28:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:28,071 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:28:28,071 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:28:28,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:28:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:28:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 144. [2018-02-02 10:28:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 10:28:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-02-02 10:28:28,074 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 38 [2018-02-02 10:28:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:28,074 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-02-02 10:28:28,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:28:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-02-02 10:28:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:28:28,075 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:28,075 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:28,075 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:28,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1035927253, now seen corresponding path program 1 times [2018-02-02 10:28:28,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:28,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:28,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:28,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:28:28,129 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:28,129 INFO L182 omatonBuilderFactory]: Interpolants [5856#(= ~unnamed0~BLACK |main_#t~mem28|), 5852#true, 5853#false, 5854#(= |main_#t~mem27| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))), 5855#(= ~unnamed0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))] [2018-02-02 10:28:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:28,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:28:28,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:28:28,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:28:28,130 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 5 states. [2018-02-02 10:28:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:28,203 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-02-02 10:28:28,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:28:28,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-02 10:28:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:28,203 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:28:28,204 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:28:28,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:28:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:28:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-02-02 10:28:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:28:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-02-02 10:28:28,206 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 38 [2018-02-02 10:28:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:28,206 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-02-02 10:28:28,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:28:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-02-02 10:28:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:28:28,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:28,206 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:28,206 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:28,206 INFO L82 PathProgramCache]: Analyzing trace with hash -712234699, now seen corresponding path program 1 times [2018-02-02 10:28:28,207 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:28,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:28:28,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:28:28,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:28:28,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:28,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-02 10:28:28,251 INFO L182 omatonBuilderFactory]: Interpolants [6150#true, 6151#false, 6152#(= 0 |main_#t~malloc0.offset|), 6153#(= main_~null~0.offset 0), 6154#(= main_~null~0.offset |main_#t~malloc4.offset|), 6155#(= main_~null~0.offset main_~list~0.offset), 6156#(and (= main_~end~0.base main_~list~0.base) (= main_~null~0.offset main_~end~0.offset)), 6157#(not (= main_~list~0.base main_~null~0.base))] [2018-02-02 10:28:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:28:28,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:28:28,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:28:28,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:28:28,252 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 8 states. [2018-02-02 10:28:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:28,365 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-02-02 10:28:28,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:28:28,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-02-02 10:28:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:28,366 INFO L225 Difference]: With dead ends: 155 [2018-02-02 10:28:28,366 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 10:28:28,366 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:28:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 10:28:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2018-02-02 10:28:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:28:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2018-02-02 10:28:28,368 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 40 [2018-02-02 10:28:28,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:28,368 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2018-02-02 10:28:28,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:28:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2018-02-02 10:28:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:28:28,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:28,368 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:28,368 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:28,368 INFO L82 PathProgramCache]: Analyzing trace with hash -274127070, now seen corresponding path program 1 times [2018-02-02 10:28:28,369 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:28,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:28,406 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:28,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:28:28,406 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:28,406 INFO L182 omatonBuilderFactory]: Interpolants [6467#true, 6468#false, 6469#(= ~unnamed0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))), 6470#(and (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) |main_#t~mem27|) (= ~unnamed0~BLACK (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))), 6471#(= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))), 6472#(= |main_#t~mem28| (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8))), 6473#(not (= ~unnamed0~RED (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))), 6474#(not (= ~unnamed0~RED |main_#t~mem32|))] [2018-02-02 10:28:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:28,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:28:28,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:28:28,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:28:28,407 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand 8 states. [2018-02-02 10:28:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:28,593 INFO L93 Difference]: Finished difference Result 168 states and 175 transitions. [2018-02-02 10:28:28,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:28:28,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-02-02 10:28:28,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:28,593 INFO L225 Difference]: With dead ends: 168 [2018-02-02 10:28:28,593 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:28:28,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:28:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:28:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 139. [2018-02-02 10:28:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 10:28:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2018-02-02 10:28:28,596 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 43 [2018-02-02 10:28:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:28,596 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2018-02-02 10:28:28,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:28:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2018-02-02 10:28:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:28:28,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:28,596 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:28,596 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:28,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2117147924, now seen corresponding path program 1 times [2018-02-02 10:28:28,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:28,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:28:28,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:28,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:28:28,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:28,705 INFO L182 omatonBuilderFactory]: Interpolants [6800#(and (= (select |#valid| main_~null~0.base) 1) (= main_~null~0.offset 0)), 6801#(and (or (= 1 (select |#valid| main_~null~0.base)) (= main_~null~0.base |main_#t~malloc4.base|)) (not (= |main_#t~malloc4.base| 0)) (= main_~null~0.offset |main_#t~malloc4.offset|)), 6802#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (= 1 (select |#valid| main_~null~0.base)) (= main_~null~0.base main_~list~0.base))), 6803#(and (= main_~end~0.base main_~list~0.base) (not (= main_~list~0.base 0)) (= main_~null~0.offset main_~end~0.offset) (or (= 1 (select |#valid| main_~null~0.base)) (= main_~end~0.base main_~null~0.base))), 6804#(and (= 1 (select |#valid| main_~null~0.base)) (not (= main_~list~0.base 0)) (not (= main_~list~0.base main_~null~0.base))), 6805#(= (select |#valid| main_~null~0.base) 1), 6796#true, 6797#false, 6798#(= 0 |main_#t~malloc0.offset|), 6799#(= main_~null~0.offset 0)] [2018-02-02 10:28:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:28:28,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:28:28,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:28:28,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:28:28,705 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand 10 states. [2018-02-02 10:28:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:29,029 INFO L93 Difference]: Finished difference Result 165 states and 173 transitions. [2018-02-02 10:28:29,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:28:29,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-02-02 10:28:29,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:29,030 INFO L225 Difference]: With dead ends: 165 [2018-02-02 10:28:29,030 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 10:28:29,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:28:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 10:28:29,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 143. [2018-02-02 10:28:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:28:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2018-02-02 10:28:29,032 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 46 [2018-02-02 10:28:29,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:29,032 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2018-02-02 10:28:29,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:28:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2018-02-02 10:28:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:28:29,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:29,032 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:29,032 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:29,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2117147951, now seen corresponding path program 1 times [2018-02-02 10:28:29,033 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:29,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:29,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:29,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:28:29,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:29,100 INFO L182 omatonBuilderFactory]: Interpolants [7136#(and (= main_~null~0.base main_~list~0.base) (= main_~list~0.offset main_~null~0.offset)), 7128#true, 7129#false, 7130#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 7131#(and (= |main_#t~mem31.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) |main_#t~mem31.base|)), 7132#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~end~0.base) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7133#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 7134#(and (= main_~null~0.base |main_#t~mem35.base|) (= main_~null~0.offset |main_#t~mem35.offset|)), 7135#(and (= main_~null~0.base main_~end~0.base) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:28:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:29,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:28:29,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:28:29,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:28:29,100 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand 9 states. [2018-02-02 10:28:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:29,422 INFO L93 Difference]: Finished difference Result 190 states and 200 transitions. [2018-02-02 10:28:29,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:28:29,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-02-02 10:28:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:29,423 INFO L225 Difference]: With dead ends: 190 [2018-02-02 10:28:29,423 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 10:28:29,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:28:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 10:28:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 156. [2018-02-02 10:28:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:28:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 164 transitions. [2018-02-02 10:28:29,425 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 164 transitions. Word has length 46 [2018-02-02 10:28:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:29,425 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 164 transitions. [2018-02-02 10:28:29,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:28:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 164 transitions. [2018-02-02 10:28:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:28:29,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:29,425 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:29,425 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:29,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1235335724, now seen corresponding path program 1 times [2018-02-02 10:28:29,426 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:29,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:28:29,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:29,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:28:29,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:29,690 INFO L182 omatonBuilderFactory]: Interpolants [7504#(and (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= (store (store |#valid| main_~list~0.base 0) main_~null~0.base 0) |old(#valid)|) (not (= main_~list~0.base main_~null~0.base))), 7505#(and (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= (store (store |#valid| main_~list~0.base 0) main_~null~0.base 0) |old(#valid)|)), 7506#(and (= |old(#valid)| (store |#valid| main_~null~0.base 0)) (not (= 0 main_~null~0.base))), 7496#true, 7497#false, 7498#(= |#valid| |old(#valid)|), 7499#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 7500#(and (= |old(#valid)| (store |#valid| main_~null~0.base 0)) (not (= 0 main_~null~0.base)) (= main_~null~0.offset 0)), 7501#(and (or (= main_~null~0.base |main_#t~malloc4.base|) (and (= (store (store |#valid| |main_#t~malloc4.base| 0) main_~null~0.base 0) |old(#valid)|) (not (= 0 main_~null~0.base)) (not (= |main_#t~malloc4.base| 0)))) (= main_~null~0.offset |main_#t~malloc4.offset|)), 7502#(and (or (and (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= (store (store |#valid| main_~list~0.base 0) main_~null~0.base 0) |old(#valid)|)) (= main_~null~0.base main_~list~0.base)) (= main_~null~0.offset main_~list~0.offset)), 7503#(and (or (and (= main_~end~0.base main_~list~0.base) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= (store (store |#valid| main_~list~0.base 0) main_~null~0.base 0) |old(#valid)|)) (= main_~end~0.base main_~null~0.base)) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:28:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:28:29,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:28:29,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:28:29,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:28:29,690 INFO L87 Difference]: Start difference. First operand 156 states and 164 transitions. Second operand 11 states. [2018-02-02 10:28:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:30,151 INFO L93 Difference]: Finished difference Result 170 states and 177 transitions. [2018-02-02 10:28:30,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:28:30,151 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-02 10:28:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:30,152 INFO L225 Difference]: With dead ends: 170 [2018-02-02 10:28:30,152 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 10:28:30,152 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:28:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 10:28:30,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-02-02 10:28:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:28:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2018-02-02 10:28:30,154 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 48 [2018-02-02 10:28:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:30,154 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2018-02-02 10:28:30,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:28:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2018-02-02 10:28:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:28:30,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:30,154 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:30,154 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:30,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1324187243, now seen corresponding path program 1 times [2018-02-02 10:28:30,155 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:30,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:30,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:30,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:28:30,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:30,393 INFO L182 omatonBuilderFactory]: Interpolants [7840#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7841#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|)) (= |main_#t~malloc9.offset| main_~list~0.offset)), 7842#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7843#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset) main_~list~0.offset)), 7844#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset)), 7845#(and (= |main_#t~mem13.offset| main_~list~0.offset) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 7846#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 7847#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 7848#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 7849#(or (and (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset) |main_#t~mem26.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 7850#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7851#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 7852#(or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7853#(or (and (= main_~null~0.offset |main_#t~mem31.offset|) (= main_~null~0.base |main_#t~mem31.base|)) (= 1 (select |#valid| |main_#t~mem31.base|))), 7854#(or (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 7855#(= 1 (select |#valid| main_~end~0.base)), 7835#true, 7836#false, 7837#(= 0 |main_#t~malloc4.offset|), 7838#(= 0 main_~list~0.offset), 7839#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1))] [2018-02-02 10:28:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:30,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:28:30,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:28:30,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:28:30,393 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand 21 states. [2018-02-02 10:28:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:31,542 INFO L93 Difference]: Finished difference Result 250 states and 263 transitions. [2018-02-02 10:28:31,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:28:31,542 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-02-02 10:28:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:31,543 INFO L225 Difference]: With dead ends: 250 [2018-02-02 10:28:31,543 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 10:28:31,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=489, Invalid=1581, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:28:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 10:28:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 182. [2018-02-02 10:28:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:28:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-02-02 10:28:31,546 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 61 [2018-02-02 10:28:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:31,547 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-02-02 10:28:31,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:28:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2018-02-02 10:28:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:28:31,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:31,547 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:31,548 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:31,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1324187244, now seen corresponding path program 1 times [2018-02-02 10:28:31,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:31,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:31,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:31,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:31,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:28:31,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:31,953 INFO L182 omatonBuilderFactory]: Interpolants [8352#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base))) (and (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset) |main_#t~mem26.offset|))), 8353#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8354#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 8355#(or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 8356#(or (and (= 0 |main_#t~mem31.offset|) (<= 12 (select |#length| |main_#t~mem31.base|))) (and (= main_~null~0.offset |main_#t~mem31.offset|) (= main_~null~0.base |main_#t~mem31.base|))), 8357#(or (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)) (and (= main_~end~0.offset 0) (<= 12 (select |#length| main_~end~0.base)))), 8358#(and (= main_~end~0.offset 0) (<= 12 (select |#length| main_~end~0.base))), 8338#true, 8339#false, 8340#(= 0 |main_#t~malloc4.offset|), 8341#(= 0 main_~list~0.offset), 8342#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 8343#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 8344#(and (= 0 |main_#t~malloc9.offset|) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|)) (= |main_#t~malloc9.offset| main_~list~0.offset)), 8345#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8346#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~list~0.offset))), 8347#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset))), 8348#(and (= 0 (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) |main_#t~mem13.base|) (= |main_#t~mem13.offset| main_~list~0.offset)), 8349#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 8350#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 0 main_~end~0.offset)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 8351#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)))] [2018-02-02 10:28:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:31,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:28:31,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:28:31,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:28:31,954 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand 21 states. [2018-02-02 10:28:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:33,294 INFO L93 Difference]: Finished difference Result 250 states and 264 transitions. [2018-02-02 10:28:33,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:28:33,294 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 61 [2018-02-02 10:28:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:33,295 INFO L225 Difference]: With dead ends: 250 [2018-02-02 10:28:33,295 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 10:28:33,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=431, Invalid=1549, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:28:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 10:28:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 185. [2018-02-02 10:28:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 10:28:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-02-02 10:28:33,297 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 61 [2018-02-02 10:28:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:33,298 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-02-02 10:28:33,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:28:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-02-02 10:28:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:28:33,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:33,298 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:33,298 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:33,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1908066703, now seen corresponding path program 2 times [2018-02-02 10:28:33,299 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:33,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:33,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:33,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:33,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:28:33,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:33,736 INFO L182 omatonBuilderFactory]: Interpolants [8842#true, 8843#false, 8844#(= 0 |main_#t~malloc4.offset|), 8845#(= 0 main_~list~0.offset), 8846#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 8847#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 8848#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|)) (= |main_#t~malloc9.offset| main_~list~0.offset)), 8849#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8850#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset) main_~list~0.offset)), 8851#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset)), 8852#(and (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem13.offset| main_~list~0.offset) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 8853#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 8854#(or (and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 8855#(or (and (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset) |main_#t~mem26.offset|)) (and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) |main_#t~mem26.offset|) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 8856#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8857#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset (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))) (= main_~null~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))))), 8858#(or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 8859#(or (and (= main_~null~0.offset |main_#t~mem31.offset|) (= main_~null~0.base |main_#t~mem31.base|)) (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|)))), 8860#(or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))), 8861#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 8862#(and (= main_~null~0.offset |main_#t~mem31.offset|) (= main_~null~0.base |main_#t~mem31.base|)), 8863#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:28:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:33,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:28:33,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:28:33,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:28:33,737 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 22 states. [2018-02-02 10:28:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:34,775 INFO L93 Difference]: Finished difference Result 258 states and 272 transitions. [2018-02-02 10:28:34,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:28:34,775 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-02-02 10:28:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:34,776 INFO L225 Difference]: With dead ends: 258 [2018-02-02 10:28:34,776 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 10:28:34,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1461, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:28:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 10:28:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 188. [2018-02-02 10:28:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 10:28:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 199 transitions. [2018-02-02 10:28:34,778 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 199 transitions. Word has length 67 [2018-02-02 10:28:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:34,778 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 199 transitions. [2018-02-02 10:28:34,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:28:34,779 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2018-02-02 10:28:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:28:34,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:34,779 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:34,779 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:34,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1627517579, now seen corresponding path program 1 times [2018-02-02 10:28:34,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:34,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:35,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:35,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:28:35,137 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:35,138 INFO L182 omatonBuilderFactory]: Interpolants [9352#true, 9353#false, 9354#(= 0 |main_#t~malloc4.offset|), 9355#(= 0 main_~list~0.offset), 9356#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 9357#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 9358#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|)) (= |main_#t~malloc9.offset| main_~list~0.offset)), 9359#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 9360#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset) main_~list~0.offset)), 9361#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset)), 9362#(and (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem13.offset| main_~list~0.offset) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 9363#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 9364#(or (and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 9365#(or (and (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset) |main_#t~mem26.offset|)) (and (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) |main_#t~mem26.offset|) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 9366#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 9367#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset (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))) (= main_~null~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))))), 9368#(or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 9369#(or (and (= main_~null~0.offset |main_#t~mem31.offset|) (= main_~null~0.base |main_#t~mem31.base|)) (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|)))), 9370#(or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))), 9371#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 9372#(and (= main_~null~0.offset |main_#t~mem29.offset|) (= main_~null~0.base |main_#t~mem29.base|)), 9373#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:28:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:35,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:28:35,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:28:35,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:28:35,138 INFO L87 Difference]: Start difference. First operand 188 states and 199 transitions. Second operand 22 states. [2018-02-02 10:28:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:36,160 INFO L93 Difference]: Finished difference Result 239 states and 250 transitions. [2018-02-02 10:28:36,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:28:36,161 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-02-02 10:28:36,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:36,161 INFO L225 Difference]: With dead ends: 239 [2018-02-02 10:28:36,161 INFO L226 Difference]: Without dead ends: 235 [2018-02-02 10:28:36,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=360, Invalid=1532, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:28:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-02-02 10:28:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 187. [2018-02-02 10:28:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-02-02 10:28:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 197 transitions. [2018-02-02 10:28:36,164 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 197 transitions. Word has length 69 [2018-02-02 10:28:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:36,164 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 197 transitions. [2018-02-02 10:28:36,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:28:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 197 transitions. [2018-02-02 10:28:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:28:36,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:36,165 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:36,165 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:36,165 INFO L82 PathProgramCache]: Analyzing trace with hash -885165937, now seen corresponding path program 1 times [2018-02-02 10:28:36,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:36,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:36,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:36,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:28:36,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:36,477 INFO L182 omatonBuilderFactory]: Interpolants [9856#(and (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base |main_#t~mem20.base|))), 9857#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 9858#(and (not (= main_~list~0.base |main_#t~mem22.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 9859#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 9860#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 9861#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 9862#(= 1 (select |#valid| |main_#t~mem31.base|)), 9863#(= 1 (select |#valid| main_~end~0.base)), 9844#true, 9845#false, 9846#(= (select |#valid| main_~list~0.base) 1), 9847#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 9848#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|))), 9849#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 9850#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 9851#(and (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem13.base|))), 9852#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 9853#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 9854#(and (not (= main_~list~0.base |main_#t~malloc18.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc18.base|))), 9855#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))))] [2018-02-02 10:28:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:36,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:28:36,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:28:36,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:28:36,478 INFO L87 Difference]: Start difference. First operand 187 states and 197 transitions. Second operand 20 states. [2018-02-02 10:28:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:37,147 INFO L93 Difference]: Finished difference Result 279 states and 293 transitions. [2018-02-02 10:28:37,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:28:37,148 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-02-02 10:28:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:37,148 INFO L225 Difference]: With dead ends: 279 [2018-02-02 10:28:37,148 INFO L226 Difference]: Without dead ends: 279 [2018-02-02 10:28:37,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:28:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-02-02 10:28:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 228. [2018-02-02 10:28:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-02-02 10:28:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 241 transitions. [2018-02-02 10:28:37,151 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 241 transitions. Word has length 70 [2018-02-02 10:28:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:37,151 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 241 transitions. [2018-02-02 10:28:37,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:28:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 241 transitions. [2018-02-02 10:28:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:28:37,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:37,152 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:37,152 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:37,152 INFO L82 PathProgramCache]: Analyzing trace with hash -885165936, now seen corresponding path program 1 times [2018-02-02 10:28:37,152 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:37,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:37,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:37,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:28:37,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:37,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-02 10:28:37,530 INFO L182 omatonBuilderFactory]: Interpolants [10409#true, 10410#false, 10411#(= (select |#valid| main_~list~0.base) 1), 10412#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 10413#(and (= 0 |main_#t~malloc9.offset|) (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| |main_#t~malloc9.base|)) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|))), 10414#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 10415#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~mem11.base|)) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~list~0.offset)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 12 (select |#length| |main_#t~mem11.base|)) (= 1 (select |#valid| main_~end~0.base))), 10416#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| |main_#t~mem13.base|)) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem13.base|))), 10417#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 10418#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= 12 (select |#length| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1)), 10419#(and (not (= main_~list~0.base |main_#t~malloc18.base|)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.offset|)) main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc18.base|))), 10420#(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_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 10421#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 12 (select |#length| main_~end~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem20.base|))), 10422#(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_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base))), 10423#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem22.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 10424#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 10425#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 10426#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 10427#(and (= 0 |main_#t~mem31.offset|) (= 12 (select |#length| |main_#t~mem31.base|))), 10428#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12))] [2018-02-02 10:28:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:37,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:28:37,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:28:37,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:28:37,530 INFO L87 Difference]: Start difference. First operand 228 states and 241 transitions. Second operand 20 states. [2018-02-02 10:28:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:38,346 INFO L93 Difference]: Finished difference Result 278 states and 293 transitions. [2018-02-02 10:28:38,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:28:38,346 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-02-02 10:28:38,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:38,347 INFO L225 Difference]: With dead ends: 278 [2018-02-02 10:28:38,347 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 10:28:38,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:28:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 10:28:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 231. [2018-02-02 10:28:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:28:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 244 transitions. [2018-02-02 10:28:38,349 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 244 transitions. Word has length 70 [2018-02-02 10:28:38,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:38,349 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 244 transitions. [2018-02-02 10:28:38,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:28:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 244 transitions. [2018-02-02 10:28:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:28:38,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:38,350 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:38,350 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:38,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1392661138, now seen corresponding path program 1 times [2018-02-02 10:28:38,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:38,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:28:38,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:38,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:28:38,548 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:38,548 INFO L182 omatonBuilderFactory]: Interpolants [10976#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset 0) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0)), 10977#(and (= main_~end~0.offset 0) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0)), 10978#(not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)), 10979#(not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)), 10980#(not (= |main_#t~mem31.base| main_~null~0.base)), 10981#(not (= main_~end~0.base main_~null~0.base)), 10966#true, 10967#false, 10968#(= 0 |main_#t~malloc0.offset|), 10969#(= main_~null~0.offset 0), 10970#(and (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 10971#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= main_~null~0.offset 0)), 10972#(and (= 0 |main_#t~malloc9.offset|) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|)) (= main_~null~0.offset 0)), 10973#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.offset 0) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 10974#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= main_~null~0.offset 0) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset))), 10975#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|) (= 0 |main_#t~mem13.offset|) (= main_~null~0.offset 0) (not (= main_~list~0.base |main_#t~mem13.base|)))] [2018-02-02 10:28:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:28:38,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:28:38,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:28:38,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:28:38,549 INFO L87 Difference]: Start difference. First operand 231 states and 244 transitions. Second operand 16 states. [2018-02-02 10:28:39,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:39,003 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2018-02-02 10:28:39,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:28:39,004 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 73 [2018-02-02 10:28:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:39,004 INFO L225 Difference]: With dead ends: 247 [2018-02-02 10:28:39,004 INFO L226 Difference]: Without dead ends: 247 [2018-02-02 10:28:39,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:28:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-02-02 10:28:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2018-02-02 10:28:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 10:28:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 243 transitions. [2018-02-02 10:28:39,007 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 243 transitions. Word has length 73 [2018-02-02 10:28:39,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:39,007 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 243 transitions. [2018-02-02 10:28:39,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:28:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 243 transitions. [2018-02-02 10:28:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:28:39,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:39,008 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:39,008 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:39,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1740111253, now seen corresponding path program 2 times [2018-02-02 10:28:39,008 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:39,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:39,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:39,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:28:39,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:39,326 INFO L182 omatonBuilderFactory]: Interpolants [11488#true, 11489#false, 11490#(= (select |#valid| main_~list~0.base) 1), 11491#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 11492#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|))), 11493#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 11494#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 11495#(and (= |main_#t~mem13.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) |main_#t~mem13.base|) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|))), 11496#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 11497#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 11498#(and (not (= main_~list~0.base |main_#t~malloc18.base|)) (= 1 (select |#valid| |main_#t~malloc18.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc18.base|)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.offset|)) main_~list~0.base) main_~list~0.offset))), 11499#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 11500#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)))) (not (= main_~end~0.base |main_#t~mem20.base|))), 11501#(and (= 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 (= main_~list~0.base |main_#t~mem22.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem22.base|))), 11502#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset)))) (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 11503#(= 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)))), 11504#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 11505#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|))), 11506#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 11507#(= 1 (select |#valid| |main_#t~mem31.base|)), 11508#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:28:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:39,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:28:39,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:28:39,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:28:39,327 INFO L87 Difference]: Start difference. First operand 231 states and 243 transitions. Second operand 21 states. [2018-02-02 10:28:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:40,308 INFO L93 Difference]: Finished difference Result 289 states and 304 transitions. [2018-02-02 10:28:40,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:28:40,309 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-02-02 10:28:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:40,309 INFO L225 Difference]: With dead ends: 289 [2018-02-02 10:28:40,309 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 10:28:40,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=1519, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:28:40,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 10:28:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 235. [2018-02-02 10:28:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-02 10:28:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 249 transitions. [2018-02-02 10:28:40,312 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 249 transitions. Word has length 76 [2018-02-02 10:28:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:40,312 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 249 transitions. [2018-02-02 10:28:40,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:28:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 249 transitions. [2018-02-02 10:28:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:28:40,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:40,313 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:40,313 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:40,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1740111254, now seen corresponding path program 2 times [2018-02-02 10:28:40,314 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:40,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:40,768 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:40,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:40,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:28:40,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:40,769 INFO L182 omatonBuilderFactory]: Interpolants [12096#(and (= 0 |main_#t~mem31.offset|) (= 12 (select |#length| |main_#t~mem31.base|))), 12097#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12)), 12077#true, 12078#false, 12079#(= (select |#valid| main_~list~0.base) 1), 12080#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 12081#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|))), 12082#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 12083#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 12084#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.offset|) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|))), 12085#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 12086#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 12087#(and (= 12 (select |#length| |main_#t~malloc18.base|)) (= 0 |main_#t~malloc18.offset|) (not (= main_~list~0.base |main_#t~malloc18.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc18.base|)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.offset|)) main_~list~0.base) main_~list~0.offset))), 12088#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 12089#(and (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~end~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem20.base|))), 12090#(and (not (= main_~list~0.base |main_#t~mem22.base|)) (= 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))) (= 12 (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)))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem22.base|))), 12091#(and (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset)))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 12092#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 12 (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))))), 12093#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 12094#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|)))), 12095#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))] [2018-02-02 10:28:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:40,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:28:40,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:28:40,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:28:40,770 INFO L87 Difference]: Start difference. First operand 235 states and 249 transitions. Second operand 21 states. [2018-02-02 10:28:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:41,796 INFO L93 Difference]: Finished difference Result 295 states and 311 transitions. [2018-02-02 10:28:41,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:28:41,796 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-02-02 10:28:41,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:41,797 INFO L225 Difference]: With dead ends: 295 [2018-02-02 10:28:41,797 INFO L226 Difference]: Without dead ends: 295 [2018-02-02 10:28:41,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:28:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-02-02 10:28:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 237. [2018-02-02 10:28:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 10:28:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 251 transitions. [2018-02-02 10:28:41,800 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 251 transitions. Word has length 76 [2018-02-02 10:28:41,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:41,800 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 251 transitions. [2018-02-02 10:28:41,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:28:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 251 transitions. [2018-02-02 10:28:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 10:28:41,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:41,801 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:41,802 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:41,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1723364401, now seen corresponding path program 1 times [2018-02-02 10:28:41,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:41,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:42,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:42,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:28:42,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:42,366 INFO L182 omatonBuilderFactory]: Interpolants [12672#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (= main_~list~0.offset |main_#t~mem13.offset|) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 12673#(and (not (= main_~list~0.base 0)) (or (and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)))), 12674#(and (not (= main_~list~0.base 0)) (or (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)))), 12675#(and (not (= main_~list~0.base 0)) (or (and (= main_~null~0.offset main_~list~0.offset) (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 12676#(and (or (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (not (= main_~list~0.base 0))), 12677#(and (not (= main_~list~0.base 0)) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.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))))), 12678#(and (or (and (= main_~end~0.base main_~list~0.base) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset main_~end~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (not (= main_~list~0.base 0)) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 12679#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~list~0.base 0)) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 12680#(and (not (= main_~list~0.base 0)) (not (= main_~list~0.base |main_#t~mem31.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem31.base|)), 12681#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~list~0.base 0)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 12682#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~list~0.base 0)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 12683#(and (not (= main_~list~0.base 0)) (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 12684#(and (not (= main_~list~0.base 0)) (= 1 (select (store |#valid| main_~list~0.base 0) |main_#t~mem35.base|))), 12685#(and (not (= main_~list~0.base 0)) (= 1 (select (store |#valid| main_~list~0.base 0) main_~end~0.base))), 12686#(= 1 (select |#valid| main_~end~0.base)), 12687#(= 1 (select |#valid| main_~list~0.base)), 12660#true, 12661#false, 12662#(= 0 |main_#t~malloc0.offset|), 12663#(= main_~null~0.offset 0), 12664#(and (not (= |main_#t~malloc4.base| 0)) (= |main_#t~malloc4.offset| 0) (= main_~null~0.offset |main_#t~malloc4.offset|)), 12665#(and (= main_~list~0.offset 0) (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0))), 12666#(and (= main_~list~0.offset 0) (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (= (select |#valid| main_~list~0.base) 1)), 12667#(and (= main_~list~0.offset 0) (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= 1 (select |#valid| main_~end~0.base))), 12668#(and (= main_~null~0.offset main_~list~0.offset) (= main_~list~0.offset |main_#t~malloc9.offset|) (not (= main_~list~0.base 0)) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (not (= main_~end~0.base |main_#t~malloc9.base|))), 12669#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 12670#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= main_~list~0.base main_~end~0.base) (= main_~list~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset))), 12671#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))] [2018-02-02 10:28:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:42,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:28:42,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:28:42,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:28:42,367 INFO L87 Difference]: Start difference. First operand 237 states and 251 transitions. Second operand 28 states. [2018-02-02 10:28:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:43,430 INFO L93 Difference]: Finished difference Result 269 states and 286 transitions. [2018-02-02 10:28:43,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:28:43,430 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 77 [2018-02-02 10:28:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:43,431 INFO L225 Difference]: With dead ends: 269 [2018-02-02 10:28:43,431 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 10:28:43,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=626, Invalid=2130, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:28:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 10:28:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 248. [2018-02-02 10:28:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-02 10:28:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 264 transitions. [2018-02-02 10:28:43,434 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 264 transitions. Word has length 77 [2018-02-02 10:28:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:43,434 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 264 transitions. [2018-02-02 10:28:43,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:28:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 264 transitions. [2018-02-02 10:28:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 10:28:43,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:43,435 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:43,435 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1723364400, now seen corresponding path program 1 times [2018-02-02 10:28:43,435 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:43,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:28:43,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:43,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:28:43,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:43,544 INFO L182 omatonBuilderFactory]: Interpolants [13264#(and (<= 0 main_~list~0.offset) (<= (+ main_~list~0.offset 12) (select |#length| main_~list~0.base))), 13255#true, 13256#false, 13257#(and (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base)), 13258#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem31.offset|) (= |main_#t~mem31.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 13259#(and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 13260#(and (<= (+ main_~end~0.offset 12) (select |#length| main_~end~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 13261#(and (<= (+ (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 12) (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))), 13262#(and (<= 0 |main_#t~mem35.offset|) (<= (+ |main_#t~mem35.offset| 12) (select |#length| |main_#t~mem35.base|))), 13263#(and (<= (+ main_~end~0.offset 12) (select |#length| main_~end~0.base)) (<= 0 main_~end~0.offset))] [2018-02-02 10:28:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:28:43,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:28:43,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:28:43,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:28:43,545 INFO L87 Difference]: Start difference. First operand 248 states and 264 transitions. Second operand 10 states. [2018-02-02 10:28:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:43,812 INFO L93 Difference]: Finished difference Result 296 states and 313 transitions. [2018-02-02 10:28:43,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:28:43,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-02-02 10:28:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:43,813 INFO L225 Difference]: With dead ends: 296 [2018-02-02 10:28:43,813 INFO L226 Difference]: Without dead ends: 296 [2018-02-02 10:28:43,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:28:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-02-02 10:28:43,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 252. [2018-02-02 10:28:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-02 10:28:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 269 transitions. [2018-02-02 10:28:43,816 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 269 transitions. Word has length 77 [2018-02-02 10:28:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:43,816 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 269 transitions. [2018-02-02 10:28:43,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:28:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 269 transitions. [2018-02-02 10:28:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 10:28:43,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:43,816 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:43,816 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash -421815399, now seen corresponding path program 1 times [2018-02-02 10:28:43,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:43,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:44,128 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:44,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:28:44,128 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:44,129 INFO L182 omatonBuilderFactory]: Interpolants [13824#false, 13825#(= (select |#valid| main_~list~0.base) 1), 13826#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 13827#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|))), 13828#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 13829#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 13830#(and (= |main_#t~mem13.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) |main_#t~mem13.base|) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|))), 13831#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 13832#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 13833#(and (not (= main_~list~0.base |main_#t~malloc18.base|)) (= 1 (select |#valid| |main_#t~malloc18.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc18.base|)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.offset|)) main_~list~0.base) main_~list~0.offset))), 13834#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 13835#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)))) (not (= main_~end~0.base |main_#t~mem20.base|))), 13836#(and (= 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 (= main_~list~0.base |main_#t~mem22.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem22.base|))), 13837#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset)))) (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 13838#(= 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)))), 13839#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 13840#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|))), 13841#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 13842#(= 1 (select |#valid| |main_#t~mem29.base|)), 13843#(= 1 (select |#valid| main_~end~0.base)), 13823#true] [2018-02-02 10:28:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:44,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:28:44,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:28:44,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:28:44,129 INFO L87 Difference]: Start difference. First operand 252 states and 269 transitions. Second operand 21 states. [2018-02-02 10:28:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:45,100 INFO L93 Difference]: Finished difference Result 306 states and 325 transitions. [2018-02-02 10:28:45,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:28:45,100 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-02-02 10:28:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:45,101 INFO L225 Difference]: With dead ends: 306 [2018-02-02 10:28:45,101 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 10:28:45,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 10:28:45,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 10:28:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 259. [2018-02-02 10:28:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 10:28:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 277 transitions. [2018-02-02 10:28:45,104 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 277 transitions. Word has length 78 [2018-02-02 10:28:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:45,104 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 277 transitions. [2018-02-02 10:28:45,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:28:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 277 transitions. [2018-02-02 10:28:45,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 10:28:45,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:45,104 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:45,104 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:45,105 INFO L82 PathProgramCache]: Analyzing trace with hash -421815398, now seen corresponding path program 1 times [2018-02-02 10:28:45,105 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:45,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:45,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:45,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:28:45,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:45,466 INFO L182 omatonBuilderFactory]: Interpolants [14464#(and (not (= main_~list~0.base |main_#t~mem22.base|)) (= 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))) (= 12 (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)))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem22.base|))), 14465#(and (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset)))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 14466#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 12 (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))))), 14467#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 14468#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|)))), 14469#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 14470#(and (= 0 |main_#t~mem29.offset|) (= 12 (select |#length| |main_#t~mem29.base|))), 14471#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12)), 14451#true, 14452#false, 14453#(= (select |#valid| main_~list~0.base) 1), 14454#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 14455#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|))), 14456#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 14457#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 14458#(and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.offset|) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|))), 14459#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 14460#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 14461#(and (= 12 (select |#length| |main_#t~malloc18.base|)) (= 0 |main_#t~malloc18.offset|) (not (= main_~list~0.base |main_#t~malloc18.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc18.base|)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.offset|)) main_~list~0.base) main_~list~0.offset))), 14462#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 14463#(and (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~end~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset))) (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem20.base|)))] [2018-02-02 10:28:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:45,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:28:45,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:28:45,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:28:45,467 INFO L87 Difference]: Start difference. First operand 259 states and 277 transitions. Second operand 21 states. [2018-02-02 10:28:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:46,495 INFO L93 Difference]: Finished difference Result 311 states and 330 transitions. [2018-02-02 10:28:46,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:28:46,495 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-02-02 10:28:46,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:46,496 INFO L225 Difference]: With dead ends: 311 [2018-02-02 10:28:46,497 INFO L226 Difference]: Without dead ends: 311 [2018-02-02 10:28:46,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:28:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-02-02 10:28:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 261. [2018-02-02 10:28:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-02 10:28:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 278 transitions. [2018-02-02 10:28:46,499 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 278 transitions. Word has length 78 [2018-02-02 10:28:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:46,499 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 278 transitions. [2018-02-02 10:28:46,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:28:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 278 transitions. [2018-02-02 10:28:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 10:28:46,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:46,500 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:46,500 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:46,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1704168564, now seen corresponding path program 2 times [2018-02-02 10:28:46,501 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:46,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:28:46,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:46,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:28:46,590 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:46,591 INFO L182 omatonBuilderFactory]: Interpolants [15074#true, 15075#false, 15076#(and (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base)), 15077#(and (= |main_#t~mem31.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) |main_#t~mem31.base|)), 15078#(and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 15079#(or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (not (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 15080#(or (not (= |main_#t~mem35.base| main_~null~0.base)) (not (= main_~null~0.offset |main_#t~mem35.offset|))), 15081#(or (not (= main_~end~0.base main_~null~0.base)) (not (= main_~null~0.offset main_~end~0.offset))), 15082#(or (not (= main_~null~0.offset main_~list~0.offset)) (not (= main_~list~0.base main_~null~0.base)))] [2018-02-02 10:28:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:28:46,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:28:46,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:28:46,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:28:46,592 INFO L87 Difference]: Start difference. First operand 261 states and 278 transitions. Second operand 9 states. [2018-02-02 10:28:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:46,869 INFO L93 Difference]: Finished difference Result 288 states and 305 transitions. [2018-02-02 10:28:46,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:28:46,869 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-02-02 10:28:46,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:46,869 INFO L225 Difference]: With dead ends: 288 [2018-02-02 10:28:46,869 INFO L226 Difference]: Without dead ends: 288 [2018-02-02 10:28:46,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:28:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-02-02 10:28:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 261. [2018-02-02 10:28:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-02-02 10:28:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 276 transitions. [2018-02-02 10:28:46,872 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 276 transitions. Word has length 79 [2018-02-02 10:28:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:46,872 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 276 transitions. [2018-02-02 10:28:46,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:28:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 276 transitions. [2018-02-02 10:28:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:28:46,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:46,872 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:46,872 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:46,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1348332433, now seen corresponding path program 1 times [2018-02-02 10:28:46,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:46,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:47,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:47,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:28:47,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:47,160 INFO L182 omatonBuilderFactory]: Interpolants [15648#(= (select |#valid| main_~list~0.base) 1), 15649#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 15650#(and (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| |main_#t~malloc9.base|)) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|))), 15651#(and (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 15652#(and (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (not (= main_~end~0.base |main_#t~mem11.base|)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 15653#(and (not (= main_~list~0.base |main_#t~mem13.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 15654#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base main_~list~0.base))), 15655#(= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 15656#(and (= main_~list~0.offset main_~end~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~list~0.base main_~end~0.base)), 15657#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) |main_#t~mem31.offset|) (= 12 (select |#length| |main_#t~mem31.base|))), 15658#(and (= (select |#length| main_~end~0.base) 12) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 15659#(and (<= (+ main_~end~0.offset 12) (select |#length| main_~end~0.base)) (= (select |#length| main_~end~0.base) 12) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 15660#(<= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0), 15661#(and (<= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0) (= |main_#t~mem35.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 15662#(and (<= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) 0) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 15663#(<= main_~end~0.offset 0), 15664#(<= main_~list~0.offset 0), 15665#(and (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0)), 15646#true, 15647#false] [2018-02-02 10:28:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:47,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:28:47,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:28:47,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:28:47,161 INFO L87 Difference]: Start difference. First operand 261 states and 276 transitions. Second operand 20 states. [2018-02-02 10:28:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:47,789 INFO L93 Difference]: Finished difference Result 289 states and 306 transitions. [2018-02-02 10:28:47,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:28:47,789 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2018-02-02 10:28:47,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:47,790 INFO L225 Difference]: With dead ends: 289 [2018-02-02 10:28:47,790 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 10:28:47,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:28:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 10:28:47,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 268. [2018-02-02 10:28:47,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-02-02 10:28:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 284 transitions. [2018-02-02 10:28:47,792 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 284 transitions. Word has length 81 [2018-02-02 10:28:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:47,793 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 284 transitions. [2018-02-02 10:28:47,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:28:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 284 transitions. [2018-02-02 10:28:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:28:47,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:47,794 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:47,794 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:47,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1151367293, now seen corresponding path program 1 times [2018-02-02 10:28:47,795 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:47,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:49,024 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:49,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:49,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 10:28:49,024 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:49,025 INFO L182 omatonBuilderFactory]: Interpolants [16259#true, 16260#false, 16261#(= 0 |main_#t~malloc0.offset|), 16262#(= main_~null~0.offset 0), 16263#(and (= (select |#valid| main_~null~0.base) 1) (= main_~null~0.offset 0)), 16264#(and (or (= main_~null~0.base |main_#t~malloc4.base|) (and (= (select |#valid| main_~null~0.base) 1) (= 0 |main_#t~malloc4.offset|))) (not (= |main_#t~malloc4.base| 0)) (= main_~null~0.offset |main_#t~malloc4.offset|)), 16265#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (= main_~null~0.base main_~list~0.base) (and (= (select |#valid| main_~null~0.base) 1) (= main_~null~0.offset 0)))), 16266#(and (= main_~null~0.offset main_~list~0.offset) (or (and (= (select |#valid| main_~null~0.base) 1) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1)) (= main_~null~0.base main_~list~0.base)) (not (= main_~list~0.base 0))), 16267#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (and (= main_~list~0.offset main_~end~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~null~0.base) 1) (= main_~null~0.offset 0)) (= main_~null~0.base main_~list~0.base))), 16268#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (and (= main_~list~0.offset main_~end~0.offset) (= 1 (select |#valid| main_~null~0.base)) (= main_~list~0.offset |main_#t~malloc9.offset|) (= main_~list~0.base main_~end~0.base) (not (= main_~end~0.base |main_#t~malloc9.base|)) (not (= main_~null~0.base |main_#t~malloc9.base|)) (= main_~null~0.offset 0)) (= main_~null~0.base main_~list~0.base))), 16269#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (and (= main_~list~0.offset main_~end~0.offset) (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= main_~null~0.base main_~list~0.base))), 16270#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (= main_~null~0.base main_~list~0.base) (and (= main_~list~0.offset main_~end~0.offset) (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (not (= main_~end~0.base |main_#t~mem11.base|)) (= main_~list~0.base main_~end~0.base) (= main_~null~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset))))), 16271#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (= main_~null~0.base main_~list~0.base) (and (= main_~list~0.offset main_~end~0.offset) (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 16272#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (and (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|) (= main_~null~0.offset 0) (= main_~list~0.offset |main_#t~mem13.offset|)) (= main_~null~0.base main_~list~0.base))), 16273#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (and (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (= main_~end~0.offset 0) (or (= main_~end~0.base main_~list~0.base) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset))) (= main_~null~0.offset 0)) (= main_~null~0.base main_~list~0.base))), 16274#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (and (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (= main_~end~0.offset 0) (or (and (= main_~end~0.base main_~list~0.base) (= |main_#t~mem26.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~null~0.offset 0)) (= main_~null~0.base main_~list~0.base))), 16275#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (and (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (= main_~end~0.offset 0) (or (and (= main_~end~0.base main_~list~0.base) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~null~0.offset 0)) (= main_~null~0.base main_~list~0.base))), 16276#(and (= main_~null~0.offset main_~list~0.offset) (or (and (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~null~0.base main_~list~0.base)) (not (= main_~list~0.base 0))), 16277#(and (= main_~end~0.base main_~list~0.base) (not (= main_~list~0.base 0)) (or (= main_~end~0.base main_~null~0.base) (and (= 1 (select |#valid| main_~null~0.base)) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= main_~null~0.offset (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) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))) (= main_~null~0.offset main_~end~0.offset)), 16278#(and (= 1 (select |#valid| main_~null~0.base)) (not (= main_~list~0.base 0)) (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select |#memory_$Pointer$.offset| main_~list~0.base) (select |#memory_$Pointer$.offset| main_~end~0.base)) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= main_~list~0.base main_~null~0.base))), 16279#(and (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (not (= main_~list~0.base 0)) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= |main_#t~mem31.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem31.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 16280#(and (= 1 (select |#valid| main_~null~0.base)) (not (= main_~list~0.base 0)) (= main_~end~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) main_~null~0.base)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base main_~null~0.base)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 16281#(and (= 1 (select |#valid| main_~null~0.base)) (not (= main_~list~0.base 0)) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= main_~null~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)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) |main_#t~mem31.base|) (not (= main_~list~0.base main_~null~0.base))), 16282#(and (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (not (= main_~list~0.base 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)) main_~end~0.base) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 16283#(and (= 1 (select |#valid| main_~null~0.base)) (not (= main_~list~0.base 0)) (or (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base main_~null~0.base)) (= main_~null~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)))), 16284#(and (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (not (= main_~list~0.base 0)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem35.base|) |main_#t~mem35.offset|)) (or (= main_~null~0.offset |main_#t~mem35.offset|) (and (= |main_#t~mem35.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base))))), 16285#(and (= 1 (select (store |#valid| main_~list~0.base 0) main_~null~0.base)) (not (= main_~list~0.base 0)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (or (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) main_~null~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= main_~null~0.offset main_~end~0.offset))), 16286#(and (= 1 (select |#valid| main_~null~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (or (= main_~null~0.offset main_~end~0.offset) (not (= main_~end~0.base main_~null~0.base)))), 16287#(and (= 1 (select |#valid| main_~null~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (or (= main_~list~0.offset main_~null~0.offset) (not (= main_~list~0.base main_~null~0.base)))), 16288#(= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 16289#(= 1 (select (store |#valid| main_~list~0.base 0) |main_#t~mem33.base|)), 16290#(= 1 (select (store |#valid| main_~list~0.base 0) main_~end~0.base)), 16291#(= 1 (select |#valid| main_~end~0.base))] [2018-02-02 10:28:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:49,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 10:28:49,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 10:28:49,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:28:49,026 INFO L87 Difference]: Start difference. First operand 268 states and 284 transitions. Second operand 33 states. [2018-02-02 10:28:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:51,505 INFO L93 Difference]: Finished difference Result 298 states and 316 transitions. [2018-02-02 10:28:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:28:51,505 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 82 [2018-02-02 10:28:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:51,506 INFO L225 Difference]: With dead ends: 298 [2018-02-02 10:28:51,506 INFO L226 Difference]: Without dead ends: 298 [2018-02-02 10:28:51,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=763, Invalid=3929, Unknown=0, NotChecked=0, Total=4692 [2018-02-02 10:28:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-02 10:28:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 272. [2018-02-02 10:28:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-02-02 10:28:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 290 transitions. [2018-02-02 10:28:51,509 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 290 transitions. Word has length 82 [2018-02-02 10:28:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:51,509 INFO L432 AbstractCegarLoop]: Abstraction has 272 states and 290 transitions. [2018-02-02 10:28:51,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 10:28:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 290 transitions. [2018-02-02 10:28:51,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:28:51,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:51,510 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:51,510 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:51,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1151367292, now seen corresponding path program 1 times [2018-02-02 10:28:51,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:51,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:52,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:52,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:28:52,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:52,236 INFO L182 omatonBuilderFactory]: Interpolants [16934#true, 16935#false, 16936#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 16937#(and (= 12 (select |#length| main_~null~0.base)) (= main_~null~0.offset 0)), 16938#(and (= 0 main_~null~0.offset) (or (and (= main_~null~0.base |main_#t~malloc4.base|) (= main_~null~0.offset |main_#t~malloc4.offset|)) (= 12 (select |#length| main_~null~0.base)))), 16939#(and (= 0 main_~null~0.offset) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 12 (select |#length| main_~null~0.base)))), 16940#(and (= 0 main_~null~0.offset) (= (select |#valid| main_~list~0.base) 1) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 12 (select |#length| main_~null~0.base)))), 16941#(and (= 0 main_~null~0.offset) (= (select |#valid| main_~end~0.base) 1) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 12 (select |#length| main_~null~0.base)))), 16942#(and (= 0 main_~null~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|)) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= main_~null~0.base |main_#t~malloc9.base|) (= 0 |main_#t~malloc9.offset|)) (= 12 (select |#length| main_~null~0.base)))), 16943#(and (= 0 main_~null~0.offset) (or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 12 (select |#length| main_~null~0.base))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 16944#(and (= 0 main_~null~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset))) (= 12 (select |#length| main_~null~0.base)))), 16945#(and (= 0 main_~null~0.offset) (or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 12 (select |#length| main_~null~0.base)))), 16946#(and (= 0 main_~null~0.offset) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= 12 (select |#length| main_~null~0.base)) (and (= 0 |main_#t~mem13.offset|) (= main_~null~0.base |main_#t~mem13.base|)))), 16947#(and (= 0 main_~null~0.offset) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= main_~end~0.offset 0) (= main_~end~0.base main_~null~0.base)) (= 12 (select |#length| main_~null~0.base)))), 16948#(and (= 0 main_~null~0.offset) (= main_~end~0.offset main_~list~0.offset) (or (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)) (= 12 (select |#length| main_~null~0.base))) (= main_~list~0.base main_~end~0.base)), 16949#(and (= 0 main_~null~0.offset) (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= 12 (select |#length| main_~null~0.base))), 16950#(and (= 0 main_~null~0.offset) (= 12 (select |#length| main_~null~0.base)) (= |main_#t~mem31.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem31.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 16951#(and (= 0 main_~null~0.offset) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~null~0.base)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 16952#(and (= 0 main_~null~0.offset) (= |main_#t~mem31.offset| (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$.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~mem31.base|) (= 12 (select |#length| main_~null~0.base))), 16953#(and (= 0 main_~null~0.offset) (= main_~end~0.offset (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$.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_~end~0.base) (= 12 (select |#length| main_~null~0.base))), 16954#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 12 (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))))), 16955#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem35.base|) |main_#t~mem35.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem35.base|) |main_#t~mem35.offset|))), 16956#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 16957#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 16958#(and (= 0 |main_#t~mem33.offset|) (= 12 (select |#length| |main_#t~mem33.base|))), 16959#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12))] [2018-02-02 10:28:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:52,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:28:52,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:28:52,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:28:52,236 INFO L87 Difference]: Start difference. First operand 272 states and 290 transitions. Second operand 26 states. [2018-02-02 10:28:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:53,742 INFO L93 Difference]: Finished difference Result 355 states and 378 transitions. [2018-02-02 10:28:53,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:28:53,742 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 82 [2018-02-02 10:28:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:53,743 INFO L225 Difference]: With dead ends: 355 [2018-02-02 10:28:53,743 INFO L226 Difference]: Without dead ends: 355 [2018-02-02 10:28:53,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=706, Invalid=3076, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:28:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-02 10:28:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 296. [2018-02-02 10:28:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-02 10:28:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 322 transitions. [2018-02-02 10:28:53,747 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 322 transitions. Word has length 82 [2018-02-02 10:28:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:53,748 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 322 transitions. [2018-02-02 10:28:53,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:28:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 322 transitions. [2018-02-02 10:28:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:28:53,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:53,749 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:53,749 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1287269915, now seen corresponding path program 3 times [2018-02-02 10:28:53,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:53,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:54,263 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:54,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:28:54,263 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:54,263 INFO L182 omatonBuilderFactory]: Interpolants [17683#true, 17684#false, 17685#(= (select |#valid| main_~list~0.base) 1), 17686#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 17687#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|))), 17688#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 17689#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 17690#(and (= |main_#t~mem13.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) |main_#t~mem13.base|) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|))), 17691#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 17692#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 17693#(and (not (= main_~list~0.base |main_#t~malloc18.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc18.base|)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.offset|)) main_~list~0.base) main_~list~0.offset))), 17694#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 17695#(and (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem20.base|))), 17696#(and (= |main_#t~mem22.offset| (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))) (= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem22.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem22.base|))), 17697#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 17698#(and (= main_~end~0.offset (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))) (= main_~end~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)))), 17699#(and (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (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))) |main_#t~mem26.offset|) (= main_~end~0.offset (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))) (= main_~end~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)))), 17700#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (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))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) (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))))), 17701#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (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)))) (= main_~null~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))) (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))))), 17702#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 17703#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|)))), 17704#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 17705#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|))), 17706#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 17707#(and (= main_~null~0.offset |main_#t~mem31.offset|) (= main_~null~0.base |main_#t~mem31.base|)), 17708#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:28:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:54,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:28:54,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:28:54,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:28:54,264 INFO L87 Difference]: Start difference. First operand 296 states and 322 transitions. Second operand 26 states. [2018-02-02 10:28:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:55,650 INFO L93 Difference]: Finished difference Result 357 states and 385 transitions. [2018-02-02 10:28:55,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:28:55,650 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 82 [2018-02-02 10:28:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:55,651 INFO L225 Difference]: With dead ends: 357 [2018-02-02 10:28:55,651 INFO L226 Difference]: Without dead ends: 357 [2018-02-02 10:28:55,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=277, Invalid=2479, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:28:55,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-02-02 10:28:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 300. [2018-02-02 10:28:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-02 10:28:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 326 transitions. [2018-02-02 10:28:55,654 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 326 transitions. Word has length 82 [2018-02-02 10:28:55,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:55,654 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 326 transitions. [2018-02-02 10:28:55,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:28:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 326 transitions. [2018-02-02 10:28:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:28:55,655 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:55,655 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:55,655 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:55,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1856009838, now seen corresponding path program 1 times [2018-02-02 10:28:55,656 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:55,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:28:56,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:56,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:28:56,022 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:56,022 INFO L182 omatonBuilderFactory]: Interpolants [18432#(and (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (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 |main_#t~mem13.base|))), 18433#(and (not (= main_~end~0.base main_~list~0.base)) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))) (= (select |#valid| main_~list~0.base) 1)), 18434#(and (not (= main_~end~0.base main_~list~0.base)) (= (select |#valid| main_~end~0.base) 1) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= (select |#valid| main_~list~0.base) 1)), 18435#(and (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.base|)) main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base |main_#t~malloc18.base|)) (not (= main_~end~0.base |main_#t~malloc18.base|))), 18436#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 18437#(and (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem20.base|)) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset))))), 18438#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 18439#(and (not (= main_~list~0.base |main_#t~mem22.base|)) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 18440#(and (not (= main_~end~0.base main_~list~0.base)) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset))))), 18441#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 18442#(or (and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 18443#(not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 18444#(not (= main_~null~0.base |main_#t~mem31.base|)), 18445#(not (= main_~null~0.base main_~end~0.base)), 18420#true, 18421#false, 18422#(= 0 |main_#t~malloc0.offset|), 18423#(= main_~null~0.offset 0), 18424#(and (= (select |#valid| main_~null~0.base) 1) (= main_~null~0.offset 0)), 18425#(and (or (not (= main_~null~0.base |main_#t~malloc4.base|)) (= main_~null~0.offset |main_#t~malloc4.offset|)) (or (= main_~null~0.base |main_#t~malloc4.base|) (= (select |#valid| main_~null~0.base) 1))), 18426#(or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (= (select |#valid| main_~null~0.base) 1)), 18427#(and (= (select |#valid| main_~null~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 18428#(and (= main_~end~0.base main_~list~0.base) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~null~0.base) 1))) (= (select |#valid| main_~end~0.base) 1)), 18429#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~malloc9.base|)) (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= main_~end~0.offset main_~list~0.offset) (not (= main_~null~0.base |main_#t~malloc9.base|))))), 18430#(and (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= main_~end~0.offset main_~list~0.offset) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))))) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 18431#(and (or (and (= main_~null~0.offset main_~list~0.offset) (= main_~null~0.base main_~list~0.base)) (and (= main_~end~0.offset main_~list~0.offset) (not (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))))) (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base)))] [2018-02-02 10:28:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:28:56,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:28:56,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:28:56,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:28:56,023 INFO L87 Difference]: Start difference. First operand 300 states and 326 transitions. Second operand 26 states. [2018-02-02 10:28:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:57,412 INFO L93 Difference]: Finished difference Result 341 states and 368 transitions. [2018-02-02 10:28:57,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:28:57,412 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 82 [2018-02-02 10:28:57,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:57,413 INFO L225 Difference]: With dead ends: 341 [2018-02-02 10:28:57,413 INFO L226 Difference]: Without dead ends: 341 [2018-02-02 10:28:57,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=578, Invalid=2178, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 10:28:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-02 10:28:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 300. [2018-02-02 10:28:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-02 10:28:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 325 transitions. [2018-02-02 10:28:57,416 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 325 transitions. Word has length 82 [2018-02-02 10:28:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:57,417 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 325 transitions. [2018-02-02 10:28:57,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:28:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 325 transitions. [2018-02-02 10:28:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 10:28:57,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:57,418 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:57,418 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:57,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1810644321, now seen corresponding path program 2 times [2018-02-02 10:28:57,419 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:57,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:57,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:57,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:28:57,875 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:57,876 INFO L182 omatonBuilderFactory]: Interpolants [19141#true, 19142#false, 19143#(= (select |#valid| main_~list~0.base) 1), 19144#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 19145#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|))), 19146#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 19147#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 19148#(and (= |main_#t~mem13.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) |main_#t~mem13.base|) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|))), 19149#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 19150#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 19151#(and (not (= main_~list~0.base |main_#t~malloc18.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc18.base|)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.offset|)) main_~list~0.base) main_~list~0.offset))), 19152#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 19153#(and (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem20.base|))), 19154#(and (= |main_#t~mem22.offset| (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))) (= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem22.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem22.base|))), 19155#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 19156#(and (= main_~end~0.offset (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))) (= main_~end~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)))), 19157#(and (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (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))) |main_#t~mem26.offset|) (= main_~end~0.offset (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))) (= main_~end~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)))), 19158#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (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))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) (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))))), 19159#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (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)))) (= main_~null~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))) (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))))), 19160#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 19161#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|)))), 19162#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 19163#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|))), 19164#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 19165#(and (= main_~null~0.offset |main_#t~mem29.offset|) (= main_~null~0.base |main_#t~mem29.base|)), 19166#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset))] [2018-02-02 10:28:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:57,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:28:57,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:28:57,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:28:57,876 INFO L87 Difference]: Start difference. First operand 300 states and 325 transitions. Second operand 26 states. [2018-02-02 10:28:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:59,160 INFO L93 Difference]: Finished difference Result 351 states and 377 transitions. [2018-02-02 10:28:59,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:28:59,160 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-02-02 10:28:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:59,161 INFO L225 Difference]: With dead ends: 351 [2018-02-02 10:28:59,161 INFO L226 Difference]: Without dead ends: 347 [2018-02-02 10:28:59,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=2291, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:28:59,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-02 10:28:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 299. [2018-02-02 10:28:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-02 10:28:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 323 transitions. [2018-02-02 10:28:59,163 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 323 transitions. Word has length 84 [2018-02-02 10:28:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:59,164 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 323 transitions. [2018-02-02 10:28:59,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:28:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 323 transitions. [2018-02-02 10:28:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:28:59,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:59,164 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:59,164 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1165306578, now seen corresponding path program 2 times [2018-02-02 10:28:59,165 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:59,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:28:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:28:59,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:28:59,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:28:59,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:28:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:28:59,280 INFO L182 omatonBuilderFactory]: Interpolants [19872#(and (= |main_#t~mem31.offset| (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$.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~mem31.base|)), 19873#(and (= main_~end~0.offset (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$.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_~end~0.base)), 19874#(and (= main_~null~0.offset (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))) (= main_~null~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)))), 19875#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem35.base|) |main_#t~mem35.offset|)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem35.base|) |main_#t~mem35.offset|))), 19876#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 19877#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 19878#(and (= main_~null~0.base |main_#t~mem35.base|) (= main_~null~0.offset |main_#t~mem35.offset|)), 19879#(and (= main_~null~0.base main_~end~0.base) (= main_~null~0.offset main_~end~0.offset)), 19880#(and (= main_~null~0.base main_~list~0.base) (= main_~list~0.offset main_~null~0.offset)), 19867#true, 19868#false, 19869#(and (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base)), 19870#(and (= |main_#t~mem31.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem31.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 19871#(and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))] [2018-02-02 10:28:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:28:59,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:28:59,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:28:59,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:28:59,280 INFO L87 Difference]: Start difference. First operand 299 states and 323 transitions. Second operand 14 states. [2018-02-02 10:28:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:28:59,767 INFO L93 Difference]: Finished difference Result 342 states and 361 transitions. [2018-02-02 10:28:59,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:28:59,767 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-02-02 10:28:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:28:59,768 INFO L225 Difference]: With dead ends: 342 [2018-02-02 10:28:59,768 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 10:28:59,768 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:28:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 10:28:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 299. [2018-02-02 10:28:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-02-02 10:28:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 323 transitions. [2018-02-02 10:28:59,771 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 323 transitions. Word has length 85 [2018-02-02 10:28:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:28:59,771 INFO L432 AbstractCegarLoop]: Abstraction has 299 states and 323 transitions. [2018-02-02 10:28:59,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:28:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 323 transitions. [2018-02-02 10:28:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:28:59,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:28:59,771 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:28:59,771 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:28:59,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1374691198, now seen corresponding path program 1 times [2018-02-02 10:28:59,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:28:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:28:59,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:00,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:00,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:29:00,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:00,232 INFO L182 omatonBuilderFactory]: Interpolants [20544#false, 20545#(= (select |#valid| main_~list~0.base) 1), 20546#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 20547#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|))), 20548#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 20549#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 20550#(and (= |main_#t~mem13.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) |main_#t~mem13.base|) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem13.base|))), 20551#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 20552#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 20553#(and (not (= main_~list~0.base |main_#t~malloc18.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc18.base|)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.offset|)) main_~list~0.base) main_~list~0.offset))), 20554#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 20555#(and (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem20.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem20.base|))), 20556#(and (= |main_#t~mem22.offset| (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))) (= |main_#t~mem22.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem22.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem22.base|))), 20557#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 20558#(and (= main_~end~0.offset (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))) (= main_~end~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)))), 20559#(and (= |main_#t~mem26.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) (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))) |main_#t~mem26.offset|) (= main_~end~0.offset (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))) (= main_~end~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)))), 20560#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (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))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) (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))))), 20561#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (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)))) (= main_~null~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))) (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))))), 20562#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 20563#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem31.base|) |main_#t~mem31.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem31.base|) |main_#t~mem31.offset|)))), 20564#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 20565#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem29.base|) |main_#t~mem29.offset|)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem29.base|) |main_#t~mem29.offset|))), 20566#(and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 20567#(and (= main_~null~0.offset |main_#t~mem31.offset|) (= main_~null~0.base |main_#t~mem31.base|)), 20568#(and (= main_~end~0.base main_~null~0.base) (= main_~null~0.offset main_~end~0.offset)), 20543#true] [2018-02-02 10:29:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:00,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:29:00,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:29:00,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:29:00,233 INFO L87 Difference]: Start difference. First operand 299 states and 323 transitions. Second operand 26 states. [2018-02-02 10:29:01,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:01,442 INFO L93 Difference]: Finished difference Result 331 states and 355 transitions. [2018-02-02 10:29:01,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:29:01,442 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 85 [2018-02-02 10:29:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:01,443 INFO L225 Difference]: With dead ends: 331 [2018-02-02 10:29:01,443 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 10:29:01,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=2115, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:29:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 10:29:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 298. [2018-02-02 10:29:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-02 10:29:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 322 transitions. [2018-02-02 10:29:01,445 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 322 transitions. Word has length 85 [2018-02-02 10:29:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:01,446 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 322 transitions. [2018-02-02 10:29:01,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:29:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 322 transitions. [2018-02-02 10:29:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:29:01,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:01,446 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:01,447 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1849213201, now seen corresponding path program 3 times [2018-02-02 10:29:01,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:01,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:01,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:01,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:29:01,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:01,671 INFO L182 omatonBuilderFactory]: Interpolants [21248#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|))), 21249#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 21250#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~mem11.base|)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 21251#(and (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem13.base|))), 21252#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 21253#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 21254#(and (not (= main_~end~0.base |main_#t~malloc9.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc9.base|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc9.base|))), 21255#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 21256#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem11.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 21257#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 21258#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem13.base|))), 21259#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 21260#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 21261#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 21262#(= 1 (select |#valid| |main_#t~mem31.base|)), 21263#(= 1 (select |#valid| main_~end~0.base)), 21244#true, 21245#false, 21246#(= (select |#valid| main_~list~0.base) 1), 21247#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1))] [2018-02-02 10:29:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:01,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:01,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:01,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:01,672 INFO L87 Difference]: Start difference. First operand 298 states and 322 transitions. Second operand 20 states. [2018-02-02 10:29:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:02,520 INFO L93 Difference]: Finished difference Result 405 states and 437 transitions. [2018-02-02 10:29:02,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:29:02,522 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 86 [2018-02-02 10:29:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:02,523 INFO L225 Difference]: With dead ends: 405 [2018-02-02 10:29:02,523 INFO L226 Difference]: Without dead ends: 405 [2018-02-02 10:29:02,523 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:29:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-02-02 10:29:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 340. [2018-02-02 10:29:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-02-02 10:29:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2018-02-02 10:29:02,526 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 86 [2018-02-02 10:29:02,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:02,526 INFO L432 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2018-02-02 10:29:02,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2018-02-02 10:29:02,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:29:02,526 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:02,526 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:02,527 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1849213202, now seen corresponding path program 2 times [2018-02-02 10:29:02,527 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:02,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:02,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:02,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:29:02,923 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:02,923 INFO L182 omatonBuilderFactory]: Interpolants [22048#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 22049#(and (= main_~end~0.base main_~list~0.base) (not (= main_~end~0.base |main_#t~mem11.base|)) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~list~0.offset)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 12 (select |#length| |main_#t~mem11.base|)) (= 1 (select |#valid| main_~end~0.base))), 22050#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| |main_#t~mem13.base|)) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem13.base|))), 22051#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 22052#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= 12 (select |#length| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1)), 22053#(and (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset |main_#t~malloc9.offset|)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~malloc9.base|)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc9.base|)) main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (not (= main_~list~0.base |main_#t~malloc9.base|))), 22054#(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_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 22055#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem11.base|)) (= 12 (select |#length| main_~end~0.base)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset))), 22056#(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_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base))), 22057#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem13.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 22058#(and (= 12 (select |#length| (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select (store |#memory_$Pointer$.offset| main_~end~0.base (store (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset main_~null~0.offset)) main_~list~0.base) main_~list~0.offset))), 22059#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 22060#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 22061#(and (= 0 |main_#t~mem31.offset|) (= 12 (select |#length| |main_#t~mem31.base|))), 22062#(and (= main_~end~0.offset 0) (= (select |#length| main_~end~0.base) 12)), 22043#true, 22044#false, 22045#(= (select |#valid| main_~list~0.base) 1), 22046#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 22047#(and (= 0 |main_#t~malloc9.offset|) (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| |main_#t~malloc9.base|)) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base |main_#t~malloc9.base|)))] [2018-02-02 10:29:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:02,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:29:02,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:29:02,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:29:02,924 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 20 states. [2018-02-02 10:29:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:03,887 INFO L93 Difference]: Finished difference Result 401 states and 432 transitions. [2018-02-02 10:29:03,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:29:03,887 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 86 [2018-02-02 10:29:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:03,888 INFO L225 Difference]: With dead ends: 401 [2018-02-02 10:29:03,888 INFO L226 Difference]: Without dead ends: 401 [2018-02-02 10:29:03,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:29:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-02-02 10:29:03,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 343. [2018-02-02 10:29:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 10:29:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 371 transitions. [2018-02-02 10:29:03,891 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 371 transitions. Word has length 86 [2018-02-02 10:29:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:03,892 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 371 transitions. [2018-02-02 10:29:03,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:29:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 371 transitions. [2018-02-02 10:29:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:29:03,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:03,892 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:03,892 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2091469325, now seen corresponding path program 1 times [2018-02-02 10:29:03,893 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:03,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:04,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:04,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:29:04,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:04,304 INFO L182 omatonBuilderFactory]: Interpolants [22848#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~list~0.base 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 22849#(and (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~end~0.base) main_~end~0.offset))) (not (= main_~list~0.base 0)) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| |main_#t~mem20.base| (store (select |#memory_$Pointer$.base| |main_#t~mem20.base|) (+ |main_#t~mem20.offset| 4) main_~end~0.base)) main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base |main_#t~mem20.base|))), 22850#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~list~0.base 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 22851#(and (not (= main_~list~0.base 0)) (not (= main_~list~0.base |main_#t~mem22.base|)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 22852#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~list~0.base 0)) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 22853#(and (not (= main_~list~0.base 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 22854#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~list~0.base 0)) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 22855#(and (not (= main_~list~0.base 0)) (not (= main_~list~0.base |main_#t~mem31.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem31.base|)), 22856#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~list~0.base 0)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 22857#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~list~0.base 0)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 1 (select |#valid| main_~end~0.base))), 22858#(and (not (= main_~list~0.base 0)) (= 1 (select (store |#valid| main_~list~0.base 0) (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 22859#(and (not (= main_~list~0.base 0)) (= 1 (select (store |#valid| main_~list~0.base 0) |main_#t~mem35.base|))), 22860#(and (not (= main_~list~0.base 0)) (= 1 (select (store |#valid| main_~list~0.base 0) main_~end~0.base))), 22861#(= 1 (select |#valid| main_~end~0.base)), 22862#(= 1 (select |#valid| main_~list~0.base)), 22835#true, 22836#false, 22837#(not (= |main_#t~malloc4.base| 0)), 22838#(not (= main_~list~0.base 0)), 22839#(and (not (= main_~list~0.base 0)) (= (select |#valid| main_~list~0.base) 1)), 22840#(and (= main_~end~0.base main_~list~0.base) (not (= main_~list~0.base 0)) (= main_~end~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~end~0.base))), 22841#(and (= main_~end~0.base main_~list~0.base) (not (= main_~list~0.base 0)) (= main_~end~0.offset main_~list~0.offset) (not (= main_~list~0.base |main_#t~malloc9.base|))), 22842#(and (= main_~end~0.base main_~list~0.base) (not (= main_~list~0.base 0)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 22843#(and (= main_~end~0.base main_~list~0.base) (not (= main_~list~0.base 0)) (not (= main_~end~0.base |main_#t~mem11.base|)) (= |main_#t~mem11.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= 1 (select |#valid| main_~end~0.base))), 22844#(and (= 1 (select |#valid| main_~list~0.base)) (not (= main_~list~0.base 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem13.base|))), 22845#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| main_~list~0.base)) (not (= main_~list~0.base 0)) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)))), 22846#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| main_~list~0.base)) (not (= main_~list~0.base 0)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= (select |#valid| main_~end~0.base) 1)), 22847#(and (not (= main_~list~0.base 0)) (not (= main_~list~0.base |main_#t~malloc18.base|)) (not (= main_~list~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc18.base|)) main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base |main_#t~malloc18.base|)))] [2018-02-02 10:29:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:04,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:29:04,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:29:04,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:29:04,304 INFO L87 Difference]: Start difference. First operand 343 states and 371 transitions. Second operand 28 states. [2018-02-02 10:29:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:05,197 INFO L93 Difference]: Finished difference Result 387 states and 417 transitions. [2018-02-02 10:29:05,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:29:05,197 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2018-02-02 10:29:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:05,198 INFO L225 Difference]: With dead ends: 387 [2018-02-02 10:29:05,198 INFO L226 Difference]: Without dead ends: 387 [2018-02-02 10:29:05,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=600, Invalid=2262, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 10:29:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-02-02 10:29:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 365. [2018-02-02 10:29:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-02-02 10:29:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 393 transitions. [2018-02-02 10:29:05,201 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 393 transitions. Word has length 86 [2018-02-02 10:29:05,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:05,201 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 393 transitions. [2018-02-02 10:29:05,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:29:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 393 transitions. [2018-02-02 10:29:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:29:05,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:05,202 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:05,202 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:05,202 INFO L82 PathProgramCache]: Analyzing trace with hash -741047966, now seen corresponding path program 1 times [2018-02-02 10:29:05,203 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:05,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:06,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:06,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 10:29:06,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:06,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-02 10:29:06,530 INFO L182 omatonBuilderFactory]: Interpolants [23680#(and (= main_~null~0.offset main_~list~0.offset) (or (= main_~null~0.base main_~list~0.base) (= main_~null~0.base |main_#t~mem13.base|) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))) (= 0 |main_#t~mem13.offset|) (= main_~null~0.offset 0)), 23681#(and (= main_~null~0.offset main_~list~0.offset) (or (and (or (= main_~null~0.base main_~list~0.base) (= main_~end~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))) (= main_~end~0.offset 0) (= main_~null~0.offset 0)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)))), 23682#(and (or (and (or (= main_~null~0.base main_~list~0.base) (= main_~end~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))) (= main_~end~0.offset 0) (= main_~null~0.offset 0)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= |main_#t~mem26.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset) |main_#t~mem26.base|))) (= main_~null~0.offset main_~list~0.offset)), 23683#(and (= main_~null~0.offset main_~list~0.offset) (or (and (or (= main_~null~0.base main_~list~0.base) (= main_~end~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))) (= main_~end~0.offset 0) (= main_~null~0.offset 0)) (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 23684#(and (= main_~null~0.offset main_~list~0.offset) (or (= main_~null~0.base main_~list~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 23685#(and (or (and (= main_~end~0.base main_~list~0.base) (or (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))) (= main_~end~0.base main_~null~0.base))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (= main_~null~0.offset main_~end~0.offset)), 23686#(or (and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select |#memory_$Pointer$.offset| main_~list~0.base) (select |#memory_$Pointer$.offset| main_~end~0.base)) (= (select |#memory_$Pointer$.base| main_~end~0.base) (select |#memory_$Pointer$.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (not (= main_~list~0.base main_~null~0.base))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 23687#(or (and (= |main_#t~mem31.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= |main_#t~mem31.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base main_~null~0.base))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 23688#(or (and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (not (= main_~list~0.base main_~null~0.base)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 23689#(or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) |main_#t~mem31.base|) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (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)) |main_#t~mem31.offset|) (not (= main_~list~0.base main_~null~0.base))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 23690#(or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= (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)) main_~end~0.offset) (not (= main_~list~0.base main_~null~0.base))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 23691#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (not (= main_~list~0.base main_~null~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 23692#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 23693#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem35.base|) |main_#t~mem35.offset|)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem35.base|) |main_#t~mem35.offset|))) (and (= |main_#t~mem35.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset |main_#t~mem35.offset|))), 23694#(or (and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset main_~end~0.offset)) (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))), 23695#(or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))) (and (= main_~null~0.base main_~end~0.base) (= main_~null~0.offset main_~end~0.offset))), 23696#(or (and (= main_~null~0.base main_~list~0.base) (= main_~list~0.offset main_~null~0.offset)) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)))), 23697#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))), 23698#(and (= main_~null~0.base |main_#t~mem33.base|) (= main_~null~0.offset |main_#t~mem33.offset|) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))), 23699#(not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) main_~null~0.base)), 23700#(not (= |main_#t~mem34.base| main_~null~0.base)), 23701#(not (= main_~list~0.base main_~null~0.base)), 23702#(or (= 1 (select |#valid| main_~null~0.base)) (not (= main_~list~0.base main_~null~0.base))), 23703#(= 1 (select |#valid| main_~null~0.base)), 23667#true, 23668#false, 23669#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 23670#(and (not (= 0 main_~null~0.base)) (= main_~null~0.offset 0)), 23671#(and (not (= 0 main_~null~0.base)) (not (= (select (store (select |#memory_$Pointer$.base| main_~null~0.base) (+ main_~null~0.offset 4) 0) main_~null~0.offset) main_~null~0.base)) (= main_~null~0.offset 0)), 23672#(and (not (= 0 main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= 0 |main_#t~malloc4.offset|) (= main_~null~0.offset |main_#t~malloc4.offset|)), 23673#(and (= main_~null~0.offset main_~list~0.offset) (not (= 0 main_~null~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= main_~null~0.offset 0)), 23674#(and (= main_~null~0.offset main_~list~0.offset) (or (= main_~list~0.base main_~null~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))) (not (= 0 main_~null~0.base)) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 23675#(and (= main_~null~0.offset main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)) (not (= 0 main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (or (= main_~null~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))) (= main_~null~0.offset 0)), 23676#(and (= 0 |main_#t~malloc9.offset|) (= main_~list~0.offset |main_#t~malloc9.offset|) (or (= main_~null~0.base main_~end~0.base) (not (= (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc9.base|)) main_~null~0.base) main_~null~0.offset) main_~null~0.base))) (= main_~list~0.base main_~end~0.base) (not (= main_~end~0.base |main_#t~malloc9.base|)) (= main_~null~0.offset 0)), 23677#(and (= main_~list~0.base main_~end~0.base) (or (= main_~null~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))) (= main_~null~0.offset 0) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 23678#(and (not (= main_~end~0.base |main_#t~mem11.base|)) (= main_~list~0.base main_~end~0.base) (or (and (or (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= main_~null~0.base |main_#t~mem11.base|))) (or (not (= (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.base)) main_~null~0.base) main_~null~0.offset) main_~null~0.base)) (= main_~null~0.base |main_#t~mem11.base|))) (= main_~null~0.base main_~end~0.base)) (= main_~list~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset))), 23679#(and (= main_~list~0.base main_~end~0.base) (or (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset) main_~null~0.base))) (= main_~null~0.offset 0) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))] [2018-02-02 10:29:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:06,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 10:29:06,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 10:29:06,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1230, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:29:06,531 INFO L87 Difference]: Start difference. First operand 365 states and 393 transitions. Second operand 37 states. [2018-02-02 10:29:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:29:10,080 INFO L93 Difference]: Finished difference Result 426 states and 455 transitions. [2018-02-02 10:29:10,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 10:29:10,080 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 87 [2018-02-02 10:29:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:29:10,081 INFO L225 Difference]: With dead ends: 426 [2018-02-02 10:29:10,081 INFO L226 Difference]: Without dead ends: 426 [2018-02-02 10:29:10,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1162, Invalid=5978, Unknown=0, NotChecked=0, Total=7140 [2018-02-02 10:29:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-02-02 10:29:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 369. [2018-02-02 10:29:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-02-02 10:29:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 397 transitions. [2018-02-02 10:29:10,086 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 397 transitions. Word has length 87 [2018-02-02 10:29:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:29:10,086 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 397 transitions. [2018-02-02 10:29:10,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 10:29:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 397 transitions. [2018-02-02 10:29:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:29:10,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:29:10,087 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:29:10,087 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr68EnsuresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 10:29:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash -741047939, now seen corresponding path program 1 times [2018-02-02 10:29:10,087 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:29:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:29:10,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:29:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:12,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:29:12,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-02-02 10:29:12,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:29:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:12,601 INFO L182 omatonBuilderFactory]: Interpolants [24595#true, 24596#false, 24597#(= (select |#valid| 0) 0), 24598#(and (not (= 0 |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|) (= (select |#valid| 0) 0)), 24599#(and (not (= 0 main_~null~0.base)) (= (select |#valid| 0) 0) (= main_~null~0.offset 0)), 24600#(and (not (= 0 main_~null~0.base)) (= (select |#valid| 0) 0) (= main_~null~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| main_~null~0.base) (+ main_~null~0.offset 4) 0) main_~null~0.offset))), 24601#(and (not (= 0 main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0) (not (= |main_#t~malloc4.base| 0)) (= 0 |main_#t~malloc4.offset|) (= main_~null~0.offset |main_#t~malloc4.offset|)), 24602#(and (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0) (= main_~null~0.offset 0)), 24603#(and (= main_~null~0.offset main_~list~0.offset) (not (= 0 main_~null~0.base)) (= main_~null~0.offset 0) (= (select |#valid| main_~list~0.base) 1) (or (= main_~list~0.base main_~null~0.base) (and (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0)))), 24604#(and (= main_~list~0.offset 0) (= main_~list~0.offset main_~end~0.offset) (not (= 0 main_~null~0.base)) (or (= main_~null~0.base main_~end~0.base) (and (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0))) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1) (= main_~null~0.offset 0)), 24605#(and (= main_~list~0.offset main_~end~0.offset) (= 0 |main_#t~malloc9.offset|) (= main_~list~0.offset |main_#t~malloc9.offset|) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (not (= main_~end~0.base |main_#t~malloc9.base|)) (= main_~null~0.offset 0) (not (= |main_#t~malloc9.base| 0)) (or (and (= 0 (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset |main_#t~malloc9.base|)) main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0)) (= main_~null~0.base main_~end~0.base))), 24606#(and (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset 0) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (or (= main_~null~0.base main_~end~0.base) (and (= main_~list~0.offset main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 24607#(and (or (and (= main_~list~0.offset main_~end~0.offset) (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem11.base| (store (select |#memory_$Pointer$.base| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.base)) main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0)) (= main_~list~0.base main_~null~0.base) (= main_~null~0.base |main_#t~mem11.base|)) (or (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= main_~null~0.base |main_#t~mem11.base|))) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (not (= main_~end~0.base |main_#t~mem11.base|)) (= main_~list~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset) 0)) (= main_~list~0.offset (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset 0) (= 0 (select (select (store |#memory_$Pointer$.offset| |main_#t~mem11.base| (store (select |#memory_$Pointer$.offset| |main_#t~mem11.base|) (+ |main_#t~mem11.offset| 4) main_~end~0.offset)) main_~end~0.base) main_~end~0.offset))), 24608#(and (or (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.base main_~end~0.base) (and (= main_~list~0.offset main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0))) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset 0) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 24609#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= 0 |main_#t~mem13.offset|) (or (= main_~null~0.base main_~list~0.base) (= main_~null~0.base |main_#t~mem13.base|) (and (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem13.base|) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0))) (= main_~null~0.offset 0) (= main_~list~0.offset |main_#t~mem13.offset|)), 24610#(or (and (not (= (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.base (select (select (store |#memory_$Pointer$.base| main_~end~0.base (store (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset main_~null~0.base)) main_~list~0.base) main_~list~0.offset)) (= (select |#valid| 0) 0)) (= main_~null~0.base main_~list~0.base) (= main_~end~0.base main_~null~0.base)) (not (= main_~list~0.base 0)) (= main_~end~0.offset 0) (not (= 0 main_~null~0.base)) (= main_~null~0.offset 0)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 24611#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset main_~list~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| 0) 0) (= (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)) |main_#t~mem25|)) (= main_~null~0.base main_~list~0.base) (= main_~end~0.base main_~null~0.base)) (not (= main_~list~0.base 0)) (= main_~end~0.offset 0) (not (= 0 main_~null~0.base)) (= main_~null~0.offset 0)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 24612#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~null~0.base main_~list~0.base) (= main_~end~0.base main_~null~0.base)) (= main_~end~0.offset 0) (not (= 0 main_~null~0.base)) (= main_~null~0.offset 0)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 24613#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~null~0.base main_~list~0.base) (= main_~end~0.base main_~null~0.base)) (= main_~end~0.offset 0) (not (= 0 main_~null~0.base)) (= main_~null~0.offset 0)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= |main_#t~mem26.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset) |main_#t~mem26.base|))), 24614#(or (and (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (or (and (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))) (= main_~null~0.base main_~list~0.base) (= main_~end~0.base main_~null~0.base)) (= main_~end~0.offset 0) (not (= 0 main_~null~0.base)) (= main_~null~0.offset 0))), 24615#(or (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (or (= main_~null~0.base main_~list~0.base) (and (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 8))))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (= main_~null~0.offset main_~list~0.offset) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= main_~null~0.offset 0))), 24616#(or (and (= main_~list~0.offset main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (or (= main_~end~0.base main_~null~0.base) (and (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 8))))) (= main_~null~0.offset 0) (= main_~null~0.offset main_~end~0.offset)) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 24617#(or (and (= main_~list~0.offset main_~end~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= main_~list~0.base main_~end~0.base) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 8))) (= main_~null~0.offset 0) (not (= main_~list~0.base main_~null~0.base))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 24618#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 8))) (= main_~null~0.offset 0) (= |main_#t~mem31.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) |main_#t~mem31.base|) (not (= main_~list~0.base main_~null~0.base))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 24619#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 8))) (= main_~null~0.offset 0) (not (= main_~list~0.base main_~null~0.base)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 24620#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 8))) (= main_~null~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)) |main_#t~mem31.offset|) (= |main_#t~mem31.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base main_~null~0.base))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 24621#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base 0)) (not (= 0 main_~null~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) main_~end~0.base) (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 8))) (= main_~null~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)) main_~end~0.offset) (not (= main_~list~0.base main_~null~0.base))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 24622#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~null~0.offset (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 |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 8))) (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)))) (= main_~null~0.offset 0) (not (= main_~list~0.base main_~null~0.base)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 24623#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~null~0.offset (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 |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 8))) (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)))) (= main_~null~0.offset 0) (= main_~null~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 24624#(or (and (= |main_#t~mem35.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= |main_#t~mem35.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 8))) (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)))) (= main_~null~0.offset 0) (= main_~null~0.base (select (select |#memory_$Pointer$.base| |main_#t~mem35.base|) |main_#t~mem35.offset|)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| |main_#t~mem35.base|) |main_#t~mem35.offset|))) (and (= |main_#t~mem35.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset |main_#t~mem35.offset|))), 24625#(or (and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) 0)) (not (= main_~list~0.base 0)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~null~0.offset 8))) (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)))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset 0) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset main_~end~0.offset))), 24626#(or (and (= main_~null~0.base main_~end~0.base) (= main_~null~0.offset main_~end~0.offset)) (and (= 1 (select (select |#memory_int| main_~end~0.base) (+ main_~null~0.offset 8))) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= (select |#valid| 0) 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~null~0.offset 0))), 24627#(or (and (not (= main_~list~0.base 0)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (or (not (= main_~null~0.offset main_~list~0.offset)) (and (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))))) (and (= main_~null~0.base main_~list~0.base) (= main_~list~0.offset main_~null~0.offset))), 24628#(and (not (= main_~list~0.base 0)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (or (not (= main_~null~0.offset main_~list~0.offset)) (and (= (select |#valid| 0) 0) (= 1 (select (select |#memory_int| main_~list~0.base) (+ main_~list~0.offset 8)))))), 24629#(and (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (or (and (= 1 |main_#t~mem32|) (= (select |#valid| 0) 0)) (not (= main_~null~0.offset main_~list~0.offset))) (= main_~null~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 24630#(and (or (not (= main_~null~0.offset main_~list~0.offset)) (= 1 (select |#valid| 0))) (not (= main_~list~0.base 0)) (= main_~null~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~null~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~null~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 24631#(and (not (= 0 |main_#t~mem33.base|)) (not (= main_~list~0.base 0)) (= main_~null~0.base |main_#t~mem33.base|) (= 0 (select (select |#memory_$Pointer$.base| main_~null~0.base) main_~null~0.offset)) (= main_~null~0.offset |main_#t~mem33.offset|) (or (= 1 (select |#valid| 0)) (<= (+ main_~null~0.offset 1) main_~list~0.offset)) (= main_~null~0.offset 0) (<= main_~null~0.offset main_~list~0.offset)), 24632#(and (not (= main_~list~0.base 0)) (not (= 0 main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (or (= 1 (select |#valid| 0)) (<= (+ main_~null~0.offset 1) main_~list~0.offset)) (= main_~null~0.offset 0) (<= main_~null~0.offset main_~list~0.offset)), 24633#(and (not (= 0 main_~end~0.base)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| 0)) (= main_~null~0.offset 0)), 24634#(and (= 0 |main_#t~mem34.base|) (not (= 0 main_~end~0.base)) (= 1 (select |#valid| 0)) (= main_~null~0.offset 0)), 24635#(and (not (= 0 main_~end~0.base)) (= 1 (select |#valid| 0)) (= main_~null~0.offset 0) (= 0 main_~list~0.base)), 24636#(and (= 1 (select |#valid| main_~list~0.base)) (= main_~null~0.offset 0)), 24637#(= 1 (select |#valid| main_~list~0.base))] [2018-02-02 10:29:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:29:12,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 10:29:12,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 10:29:12,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1660, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:29:12,602 INFO L87 Difference]: Start difference. First operand 369 states and 397 transitions. Second operand 43 states. [2018-02-02 10:29:13,338 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 153 DAG size of output 59 Received shutdown request... [2018-02-02 10:29:15,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:29:15,218 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:29:15,222 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:29:15,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:29:15 BoogieIcfgContainer [2018-02-02 10:29:15,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:29:15,223 INFO L168 Benchmark]: Toolchain (without parser) took 52796.37 ms. Allocated memory was 404.8 MB in the beginning and 1.4 GB in the end (delta: 949.5 MB). Free memory was 358.8 MB in the beginning and 897.3 MB in the end (delta: -538.5 MB). Peak memory consumption was 410.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:29:15,224 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:29:15,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.56 ms. Allocated memory is still 404.8 MB. Free memory was 358.8 MB in the beginning and 346.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:29:15,224 INFO L168 Benchmark]: Boogie Preprocessor took 33.67 ms. Allocated memory is still 404.8 MB. Free memory was 346.9 MB in the beginning and 344.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:29:15,225 INFO L168 Benchmark]: RCFGBuilder took 453.99 ms. Allocated memory is still 404.8 MB. Free memory was 344.3 MB in the beginning and 301.9 MB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:29:15,225 INFO L168 Benchmark]: TraceAbstraction took 52135.48 ms. Allocated memory was 404.8 MB in the beginning and 1.4 GB in the end (delta: 949.5 MB). Free memory was 301.9 MB in the beginning and 897.3 MB in the end (delta: -595.5 MB). Peak memory consumption was 354.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:29:15,226 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.18 ms. Allocated memory is still 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 170.56 ms. Allocated memory is still 404.8 MB. Free memory was 358.8 MB in the beginning and 346.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.67 ms. Allocated memory is still 404.8 MB. Free memory was 346.9 MB in the beginning and 344.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 453.99 ms. Allocated memory is still 404.8 MB. Free memory was 344.3 MB in the beginning and 301.9 MB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52135.48 ms. Allocated memory was 404.8 MB in the beginning and 1.4 GB in the end (delta: 949.5 MB). Free memory was 301.9 MB in the beginning and 897.3 MB in the end (delta: -595.5 MB). Peak memory consumption was 354.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1023). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1070). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1059). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1064). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1065). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1064). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1059). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1065). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1023). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1060). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1070). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (369states) and interpolant automaton (currently 29 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 68 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 163 locations, 69 error locations. TIMEOUT Result, 52.1s OverallTime, 49 OverallIterations, 4 TraceHistogramMax, 36.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4256 SDtfs, 20860 SDslu, 26638 SDs, 0 SdLazy, 39477 SolverSat, 3656 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1574 GetRequests, 155 SyntacticMatches, 57 SemanticMatches, 1361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12110 ImplicationChecksByTransitivity, 27.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 42/439 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, 48 MinimizatonAttempts, 1797 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 2766 NumberOfCodeBlocks, 2766 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2717 ConstructedInterpolants, 0 QuantifiedInterpolants, 3676009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 17 PerfectInterpolantSequences, 42/439 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-29-15-231.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-29-15-231.csv Completed graceful shutdown